Name
Abstract | ||
|---|---|---|
Memory-Based Reasoning and K-Nearest Neighbor Searching are frequently adopted data mining techniques. But, they suffer from scalability. Indexing is a promising solution. However, it is difficult to index categorical attributes, since there does not exist linear ordering property among categories in a nominal attribute. In this paper, we proposed heuristic algorithms to map categories to numbers. Distance relationships among categories are preserved as many as possible. We empirically studied the performance of the algorithms under different distance situations. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30133-2_166 | LECTURE NOTES IN COMPUTER SCIENCE |
DocType | Volume | ISSN |
Conference | 3214 | 0302-9743 |
Citations | PageRank | References |
2 | 0.44 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huang-Cheng Kuo | 1 | 42 | 23.87 |
| Yi-sen Lin | 2 | 2 | 0.44 |
| Jen-Peng Huang | 3 | 57 | 6.45 |