Sciweavers

1768 search results - page 216 / 354
» Mining Very Large Databases
Sort
View
153
Voted
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
15 years 7 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 3 months ago
Buffering in query evaluation over XML streams
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
143
Voted
WSCG
2003
161views more  WSCG 2003»
15 years 5 months ago
A Visualization-based Approach to Explore Geographic Metadata
The paper presents a visualization-based approach to explore large databases of geographic metadata. The aim of the data exploration is to search and acquire expressive geographic...
Riccardo Albertoni, Alessio Bertone, Monica De Mar...
121
Voted
NN
2006
Springer
113views Neural Networks» more  NN 2006»
15 years 3 months ago
Large-scale data exploration with the hierarchically growing hyperbolic SOM
We introduce the Hierarchically Growing Hyperbolic Self-Organizing Map (H2 SOM) featuring two extensions of the HSOM (hyperbolic SOM): (i) a hierarchically growing variant that al...
Jörg Ontrup, Helge Ritter
SEMWEB
2010
Springer
15 years 1 months ago
Auto-experimentation of KDD Workflows Based on Ontological Planning
One of the problems of Knowledge Discovery in Databases (KDD) is the lack of user support for solving KDD problems. Current Data Mining (DM) systems enable the user to manually des...
Floarea Serban