Sciweavers

148 search results - page 4 / 30
» Context-Based Distance Learning for Categorical Data Cluster...
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
BIRTHDAY
2010
Springer
13 years 10 months ago
Clustering the Normalized Compression Distance for Influenza Virus Data
The present paper analyzes the usefulness of the normalized compression distance for the problem to cluster the hemagglutinin (HA) sequences of influenza virus data for the HA gene...
Kimihito Ito, Thomas Zeugmann, Yu Zhu
KDD
2002
ACM
293views Data Mining» more  KDD 2002»
14 years 7 months ago
Automatic Categorization of Web Pages and User Clustering with Mixtures of Hidden Markov Models
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
Alexander Ypma, Tom Heskes
ICML
2010
IEEE
13 years 8 months ago
The Translation-invariant Wishart-Dirichlet Process for Clustering Distance Data
We present a probabilistic model for clustering of objects represented via pairwise dissimilarities. We propose that even if an underlying vectorial representation exists, it is b...
Julia E. Vogt, Sandhya Prabhakaran, Thomas J. Fuch...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 7 months ago
Nonlinear adaptive distance metric learning for clustering
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...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu