Sciweavers

922 search results - page 171 / 185
» A data mining approach to database compression
Sort
View
SAC
2009
ACM
14 years 5 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 11 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
14 years 5 months ago
Knowledge Discovery from Citation Networks
—Knowledge discovery from scientific articles has received increasing attentions recently since huge repositories are made available by the development of the Internet and digit...
Zhen Guo, Zhongfei Zhang, Shenghuo Zhu, Yun Chi, Y...
SIGIR
2003
ACM
14 years 4 months ago
Collaborative filtering via gaussian probabilistic latent semantic analysis
Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, i.e. a database of available user preferences. In this ...
Thomas Hofmann
CIKM
2001
Springer
14 years 3 months ago
Selecting Relevant Instances for Efficient and Accurate Collaborative Filtering
Collaborative filtering uses a database about consumers’ preferences to make personal product recommendations and is achieving widespread success in both E-Commerce and Informat...
Kai Yu, Xiaowei Xu, Martin Ester, Hans-Peter Krieg...