Sciweavers

1681 search results - page 260 / 337
» Adaptive Clustering of Search Results
Sort
View
SIGMOD
2008
ACM
109views Database» more  SIGMOD 2008»
16 years 29 days ago
Extreme visualization: squeezing a billion records into a million pixels
Database searches are usually performed with query languages and form fill in templates, with results displayed in tabular lists. However, excitement is building around dynamic qu...
Ben Shneiderman
102
Voted
ICPADS
2005
IEEE
15 years 6 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
109
Voted
CIKM
2005
Springer
15 years 6 months ago
Generating better concept hierarchies using automatic document classification
This paper presents a hybrid concept hierarchy development technique for web returned documents retrieved by a meta-search engine. The aim of the technique is to separate the init...
Razvan Stefan Bot, Yi-fang Brook Wu, Xin Chen, Qua...
100
Voted
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 6 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
133
Voted
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 5 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs