Sciweavers

656 search results - page 82 / 132
» Data Mining and the Web: Past, Present and Future
Sort
View
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 8 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
14 years 2 months ago
Semantic Full-Text Search with ESTER: Scalable, Easy, Fast
We present a demo of ESTER, a search engine that combines the ease of use, speed and scalability of full-text search with the powerful semantic capabilities of ontologies. ESTER s...
Holger Bast, Fabian M. Suchanek, Ingmar Weber
CINQ
2004
Springer
133views Database» more  CINQ 2004»
13 years 11 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
WWW
2006
ACM
14 years 8 months ago
Detecting spam web pages through content analysis
In this paper, we continue our investigations of "web spam": the injection of artificially-created pages into the web in order to influence the results from search engin...
Alexandros Ntoulas, Marc Najork, Mark Manasse, Den...