Sciweavers

587 search results - page 33 / 118
» Clustering Improves the Exploration of Graph Mining Results
Sort
View
CORR
2007
Springer
170views Education» more  CORR 2007»
14 years 11 months ago
The structure of verbal sequences analyzed with unsupervised learning techniques
Data mining allows the exploration of sequences of phenomena, whereas one usually tends to focus on isolated phenomena or on the relation between two phenomena. It offers invaluab...
Catherine Recanati, Nicoleta Rogovschi, Youn&egrav...
LWA
2007
15 years 1 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
TKDE
2011
362views more  TKDE 2011»
14 years 6 months ago
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
Luh Yen, Marco Saerens, François Fouss
ICDM
2003
IEEE
125views Data Mining» more  ICDM 2003»
15 years 5 months ago
Clustering Item Data Sets with Association-Taxonomy Similarity
We explore in this paper the efficient clustering of item data. Different from those of the traditional data, the features of item data are known to be of high dimensionality and...
Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen
AAAI
2008
15 years 2 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang