Sciweavers

7150 search results - page 987 / 1430
» Graph-Based Data Mining
Sort
View
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
15 years 11 months ago
A Generalization of Proximity Functions for K-Means
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
Junjie Wu, Hui Xiong, Jian Chen, Wenjun Zhou
ICDM
2007
IEEE
157views Data Mining» more  ICDM 2007»
15 years 11 months ago
Failure Prediction in IBM BlueGene/L Event Logs
Frequent failures are becoming a serious concern to the community of high-end computing, especially when the applications and the underlying systems rapidly grow in size and compl...
Yinglung Liang, Yanyong Zhang, Hui Xiong, Ramendra...
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
15 years 11 months ago
A Comparative Study of Methods for Transductive Transfer Learning
The problem of transfer learning, where information gained in one learning task is used to improve performance in another related task, is an important new area of research. While...
Andrew Arnold, Ramesh Nallapati, William W. Cohen
ICDM
2006
IEEE
110views Data Mining» more  ICDM 2006»
15 years 11 months ago
Manifold Clustering of Shapes
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
Dragomir Yankov, Eamonn J. Keogh
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 11 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...