Sciweavers

629 search results - page 17 / 126
» The Generalized Quantum Database Search Algorithm
Sort
View
KDD
1995
ACM
67views Data Mining» more  KDD 1995»
14 years 4 days ago
A Perspective on Databases and Data Mining
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
Marcel Holsheimer, Martin L. Kersten, Heikki Manni...
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 1 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 9 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
SIGIR
2003
ACM
14 years 1 months ago
Implicit link analysis for small web search
Current Web search engines generally impose link analysis-based re-ranking on web-page retrieval. However, the same techniques, when applied directly to small web search such as i...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying M...
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 8 months ago
The TopX DB&IR engine
This paper proposes a demo of the TopX search engine, an extensive framework for unified indexing, querying, and ranking of large collections of unstructured, semistructured, and ...
Martin Theobald, Ralf Schenkel, Gerhard Weikum