2227 search results - page 228 / 446 » Graph Mining based on a Data Partitioning Approach |
105
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
: Topic Modeling Ensembles Zhiyong Shen, Ping Luo, Shengwen Yang, Xukun Shen HP Laboratories HPL-2010-158 Topic model, Ensemble In this paper we propose a framework of topic model...
138
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
141
Voted
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
108
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generati...
178
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...