Sciweavers

39 search results - page 1 / 8
» Spectral clustering for multi-type relational data
Sort
View
ESANN
2007
13 years 6 months ago
Feature clustering and mutual information for the selection of variables in spectral data
Spectral data often have a large number of highly-correlated features, making feature selection both necessary and uneasy. A methodology combining hierarchical constrained clusteri...
Catherine Krier, Damien François, Fabrice R...
ACL
2006
13 years 5 months ago
Unsupervised Relation Disambiguation Using Spectral Clustering
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...
ICML
2006
IEEE
14 years 5 months ago
Spectral clustering for multi-type relational data
Clustering on multi-type relational data has attracted more and more attention in recent years due to its high impact on various important applications, such as Web mining, e-comm...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
ICONIP
2008
13 years 6 months ago
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...
Tina Geweniger, Frank-Michael Schleif, Alexander H...
NIPS
2008
13 years 6 months ago
Spectral Clustering with Perturbed Data
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
Ling Huang, Donghui Yan, Michael I. Jordan, Nina T...