Sciweavers

7150 search results - page 1085 / 1430
» Graph-Based Data Mining
Sort
View
114
Voted
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
15 years 9 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom
87
Voted
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
15 years 9 months ago
Boosting Relational Sequence Alignments
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
Andreas Karwath, Kristian Kersting, Niels Landwehr
121
Voted
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
15 years 9 months ago
Latent Dirichlet Allocation and Singular Value Decomposition Based Multi-document Summarization
Multi-Document Summarization deals with computing a summary for a set of related articles such that they give the user a general view about the events. One of the objectives is th...
Rachit Arora, Balaraman Ravindran
158
Voted
ICDM
2008
IEEE
230views Data Mining» more  ICDM 2008»
15 years 9 months ago
Evolutionary Clustering by Hierarchical Dirichlet Process with Hidden Markov State
This paper studies evolutionary clustering, which is a recently hot topic with many important applications, noticeably in social network analysis. In this paper, based on the rece...
Tianbing Xu, Zhongfei (Mark) Zhang, Philip S. Yu, ...
86
Voted
SISAP
2008
IEEE
98views Data Mining» more  SISAP 2008»
15 years 9 months ago
On Reinsertions in M-tree
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...
Jakub Lokoc, Tomás Skopal
« Prev « First page 1085 / 1430 Last » Next »