Sciweavers

209 search results - page 39 / 42
» Local Search for Statistical Counting
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
BMCBI
2005
125views more  BMCBI 2005»
13 years 8 months ago
Query3d: a new method for high-throughput analysis of functional residues in protein structures
Background: The identification of local similarities between two protein structures can provide clues of a common function. Many different methods exist for searching for similar ...
Gabriele Ausiello, Allegra Via, Manuela Helmer-Cit...
WSDM
2010
ACM
365views Data Mining» more  WSDM 2010»
14 years 6 months ago
A Novel Click Model and Its Applications to Online Advertising
Recent advances in click model have positioned it as an attractive method for representing user preferences in web search and online advertising. Yet, most of the existing works f...
Zeyuan Allen Zhu, Weizhu Chen, Tom Minka, Chenguan...
WWW
2003
ACM
14 years 9 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
WWW
2010
ACM
14 years 3 months ago
Equip tourists with knowledge mined from travelogues
With the prosperity of tourism and Web 2.0 technologies, more and more people have willingness to share their travel experiences on the Web (e.g., weblogs, forums, or Web 2.0 comm...
Qiang Hao, Rui Cai, Changhu Wang, Rong Xiao, Jiang...