Sciweavers

960 search results - page 54 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
144
Voted
SAC
2000
ACM
15 years 7 months ago
Efficient and Flexible Web Access to Art-Historical Image Collections
Modern object-relational database systems are capable of managing multimedia data, e.g. image, video and audio. In this paper we study how such universal database systems can be u...
Matthias Wagner, Stefan Holland, Werner Kieß...
148
Voted
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 7 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
141
Voted
EDBT
2008
ACM
167views Database» more  EDBT 2008»
16 years 3 months ago
HISSCLU: a hierarchical density-based method for semi-supervised clustering
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
Christian Böhm, Claudia Plant
175
Voted
VLDB
2002
ACM
154views Database» more  VLDB 2002»
15 years 3 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
136
Voted
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 7 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic