Sciweavers

2260 search results - page 170 / 452
» A new algorithm for clustering search results
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Revisiting probabilistic models for clustering with pair-wise constraints
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
Blaine Nelson, Ira Cohen
MIR
2010
ACM
163views Multimedia» more  MIR 2010»
15 years 8 months ago
SNDocRank: a social network-based video search ranking framework
Multimedia ranking algorithms are usually user-neutral and measure the importance and relevance of documents by only using the visual contents and meta-data. However, users’ int...
Liang Gou, Hung-Hsuan Chen, Jung-Hyun Kim, Xiaolon...
WWW
2009
ACM
15 years 11 months ago
Extracting data records from the web using tag path clustering
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
Gengxin Miao, Jun'ichi Tatemura, Wang-Pin Hsiung, ...
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
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 6 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor