Sciweavers

507 search results - page 61 / 102
» Portfolio theory of information retrieval
Sort
View
ACMSE
2010
ACM
13 years 5 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
WWW
2009
ACM
14 years 8 months ago
Learning to tag
Social tagging provides valuable and crucial information for large-scale web image retrieval. It is ontology-free and easy to obtain; however, irrelevant tags frequently appear, a...
Lei Wu, Linjun Yang, Nenghai Yu, Xian-Sheng Hua
WWW
2005
ACM
14 years 8 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin