Sciweavers

2089 search results - page 400 / 418
» A New Problem in String Searching
Sort
View
WWW
2004
ACM
15 years 10 months ago
Shilling recommender systems for fun and profit
Recommender systems have emerged in the past several years as an effective way to help people cope with the problem of information overload. One application in which they have bec...
Shyong K. Lam, John Riedl
KDD
2007
ACM
176views Data Mining» more  KDD 2007»
15 years 10 months ago
Mining correlated bursty topic patterns from coordinated text streams
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
Xuanhui Wang, ChengXiang Zhai, Xiao Hu, Richard Sp...
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
15 years 10 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
84
Voted
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
15 years 10 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu