Sciweavers

148 search results - page 7 / 30
» Context-Based Distance Learning for Categorical Data Cluster...
Sort
View
ICML
2004
IEEE
16 years 1 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
NIPS
2004
15 years 1 months ago
The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
Robert Jenssen, Deniz Erdogmus, José Carlos...
WSOM
2009
Springer
15 years 7 months ago
Career-Path Analysis Using Optimal Matching and Self-Organizing Maps
Abstract. This paper is devoted to the analysis of career paths and employability. The state-of-the-art on this topic is rather poor in methodologies. Some authors propose distance...
Sébastien Massoni, Madalina Olteanu, Patric...
92
Voted
ECML
2001
Springer
15 years 4 months ago
Iterative Double Clustering for Unsupervised and Semi-supervised Learning
We present a powerful meta-clustering technique called Iterative Double Clustering (IDC). The IDC method is a natural extension of the recent Double Clustering (DC) method of Slon...
Ran El-Yaniv, Oren Souroujon
COMAD
2009
15 years 1 months ago
Categorizing Concepts for Detecting Drifts in Stream
Mining evolving data streams for concept drifts has gained importance in applications like customer behavior analysis, network intrusion detection, credit card fraud detection. Se...
Sharanjit Kaur, Vasudha Bhatnagar, Sameep Mehta, S...