512 search results - page 35 / 103 » k-Means Projective Clustering |
EUROPAR
2001
Springer
14 years 16 days ago
2001
Springer
GRM was originally designed and implemented as part of the P-GRADE graphical parallel program development environment running on supercomputers and clusters. In the framework of th...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Maximum margin clustering (MMC) has recently attracted considerable interests in both the data mining and machine learning communities. It first projects data samples to a kernel...
BPM
2009
Springer
14 years 2 months ago
2009
Springer
The goal of performance analysis of business processes is to gain insights into operational processes, for the purpose of optimizing them. To intuitively show which parts of the pr...
ECML
2004
Springer
14 years 1 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...