Sciweavers

4560 search results - page 659 / 912
» Finding Data in the Neighborhood
Sort
View
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
206views Data Mining» more  KDD 2009»
16 years 7 months ago
Ranking-based clustering of heterogeneous information networks with star network schema
A heterogeneous information network is an information network composed of multiple types of objects. Clustering on such a network may lead to better understanding of both hidden s...
Yizhou Sun, Yintao Yu, Jiawei Han
248
Voted
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 7 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
KDD
2008
ACM
284views Data Mining» more  KDD 2008»
16 years 7 months ago
Community evolution in dynamic multi-mode networks
A multi-mode network typically consists of multiple heterogeneous social actors among which various types of interactions could occur. Identifying communities in a multi-mode netw...
Lei Tang, Huan Liu, Jianping Zhang, Zohreh Nazeri
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 7 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...