Sciweavers

1768 search results - page 172 / 354
» Mining Very Large Databases
Sort
View
148
Voted
VLDB
2004
ACM
187views Database» more  VLDB 2004»
15 years 8 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi
162
Voted
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
15 years 7 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen
125
Voted
PAKDD
2010
ACM
167views Data Mining» more  PAKDD 2010»
15 years 7 months ago
Resource-Bounded Information Extraction: Acquiring Missing Feature Values on Demand
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
Pallika Kanani, Andrew McCallum, Shaohan Hu
140
Voted
BMCBI
2007
177views more  BMCBI 2007»
15 years 3 months ago
The BioPrompt-box: an ontology-based clustering tool for searching in biological databases
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
Claudio Corsi, Paolo Ferragina, Roberto Marangoni
KDD
2009
ACM
187views Data Mining» more  KDD 2009»
16 years 4 months ago
New ensemble methods for evolving data streams
Advanced analysis of data streams is quickly becoming a key area of data mining research as the number of applications demanding such processing increases. Online mining when such...
Albert Bifet, Bernhard Pfahringer, Geoffrey Holmes...