Sciweavers

3133 search results - page 479 / 627
» Representing clusters for retrieval
Sort
View
KDD
2009
ACM
194views Data Mining» more  KDD 2009»
16 years 7 months ago
Combining link and content for community detection: a discriminative approach
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
Tianbao Yang, Rong Jin, Yun Chi, Shenghuo Zhu
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 7 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
KDD
2009
ACM
209views Data Mining» more  KDD 2009»
16 years 7 months ago
Collective annotation of Wikipedia entities in web text
To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must be identified as references to real-world...
Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, ...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 7 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
16 years 7 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo