2227 search results - page 59 / 446 » Graph Mining based on a Data Partitioning Approach |
108
Voted
ESA
2003
Springer
15 years 5 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
106
Voted
AAAI
2008
15 years 2 months ago
2008
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...
96
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
117
Voted
KAIS
2008
15 years 15 days ago
2008
Abstract. Quantitative Association Rule (QAR) mining has been recognized an influential research problem over the last decade due to the popularity of quantitative databases and th...
110
Voted
JIIS
2006
15 years 15 days ago
2006
In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream pro...