Sciweavers

26 search results - page 2 / 6
» Probabilistic clustering by random swap algorithm
Sort
View
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 2 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 5 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 5 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
ICPR
2008
IEEE
13 years 11 months ago
A probabilistic model for classifying segmented images
In this work we introduce a probabilistic model for classifying segmented images. The proposed classifier is very general and it can deal both with images that were segmented wit...
Liang Wu, Predrag Neskovic, Leon N. Cooper
AAAI
2008
13 years 7 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