Name
Abstract | ||
|---|---|---|
A classification framework using only a set of distance matrices is proposed. The proposed algorithm can learn a classifier only from a set of distance matrices or similarity matrices, hence applicable to structured data, which do not have natural vector representation such as time series and graphs. Random forest is used to explore ideal feature representation based on the distance between points defined by a set of given distance matrices. The effectiveness of the proposed method is evaluated through experiments with point process data and graph structured data. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-22482-4_33 | LVA/ICA |
Keywords | DocType | Volume |
Classification,Structured data,Decision trees,Random forest,Spike train,Graph kernel | Conference | 9237 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ken Takano | 1 | 1 | 0.36 |
| Hideitsu Hino | 2 | 99 | 25.73 |
| Yuki Yoshikawa | 3 | 1 | 0.36 |
| Noboru Murata | 4 | 855 | 170.36 |