Sciweavers

1617 search results - page 251 / 324
» Recommender Systems
Sort
View
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 6 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 5 months ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 5 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
CHI
2006
ACM
16 years 5 months ago
Motivating participation by displaying the value of contribution
One of the important challenges faced by designers of online communities is eliciting sufficent contributions from community members. Users in online communities may have difficul...
Al Mamunur Rashid, Kimberly S. Ling, Regina D. Tas...
CHI
2005
ACM
16 years 5 months ago
Feature congestion: a measure of display clutter
Management of clutter is an important factor in the design of user interfaces and information visualizations, allowing improved usability and aesthetics. However, clutter is not a...
Ruth Rosenholtz, Yuanzhen Li, Jonathan Mansfield, ...