Sciweavers

1413 search results - page 142 / 283
» Mining Multiple Large Databases
Sort
View
259
Voted
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 5 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
99
Voted
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
15 years 6 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
BMCBI
2010
113views more  BMCBI 2010»
15 years 2 months ago
Gene prioritization and clustering by multi-view text mining
Background: Text mining has become a useful tool for biologists trying to understand the genetics of diseases. In particular, it can help identify the most interesting candidate g...
Shi Yu, Léon-Charles Tranchevent, Bart De M...
92
Voted
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
15 years 7 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf
131
Voted
MMDB
2004
ACM
148views Multimedia» more  MMDB 2004»
15 years 8 months ago
A unified framework for image database clustering and content-based retrieval
With the proliferation of image data, the need to search and retrieve images efficiently and accurately from a large image database or a collection of image databases has drastica...
Mei-Ling Shyu, Shu-Ching Chen, Min Chen, Chengcui ...