Sciweavers

3241 search results - page 243 / 649
» Searching for Hidden-Web Databases
Sort
View
ICDE
2008
IEEE
119views Database» more  ICDE 2008»
15 years 11 months ago
NGS: a framework for multi-domain query answering
— If we consider a query involving multiple domains, such as “find all database conferences held within six months in locations whose seasonal average temperature is 28◦ C a...
Daniele Braga, Diego Calvanese, Alessandro Campi, ...
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 8 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
15 years 10 months ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
ICDE
2005
IEEE
132views Database» more  ICDE 2005»
15 years 10 months ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
Mohammed Javeed Zaki, Markus Peters
JCDL
2004
ACM
88views Education» more  JCDL 2004»
15 years 10 months ago
A query interface for an event gazetteer
We introduce an event gazetteer which stores and presents “locations in time”. Each event is coded with attributes of event type, location, actor, and beginning and ending tim...
Robert B. Allen