-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathREADME
61 lines (46 loc) · 1.12 KB
/
README
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
### here
sparse data is categorical data, not necessary
we have to modify the code to do classification, and for multiclass
by jinluyang
Data Format
===========
The input of this GBDT solver consists of a label vector (y), a dense matrix
(XD), and a binary sparse matrix (XS). The input format of these two matrices
are introduced in the following two sections.
Dense Matrix
------------
The input format is:
<label> <value_1> <value_2> ...
.
.
.
Note that to represent a dense matrix, we do not have to give indices. For
example,
1 32 91 27 44
0 13 25 55 83
0 32 11 78 99
represents:
y XD
1 32 91 27 44
0 13 25 55 83
0 32 11 78 99
Binary Sparse Matrix
--------------------
The input format is:
<label> <index_1> <index_2> ...
.
.
.
To represent a binary sparse matrix, we only need to know where non-zero
elements are, so values are not specified.
For example,
1 2 9 5
0 1 3 7
0 4 8 2
represents:
y XS
1 0 1 0 0 1 0 0 0 1
0 1 0 1 0 0 0 1 0 0
0 0 1 0 1 0 0 0 1 0
Note that the labels in binary sparse matrix are just dummies. They do not have
pratical use; please specify correct labels in dense matrix.