Sciweavers

3122 search results - page 148 / 625
» Storing Semistructured Data with STORED
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 10 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
IPPS
2006
IEEE
14 years 4 months ago
An entropy-based algorithm for time-driven software instrumentation in parallel systems
While monitoring, instrumented long running parallel applications generate huge amount of instrumentation data. Processing and storing this data incurs overhead, and perturbs the ...
A. Ozmen
INFOVIS
2002
IEEE
14 years 3 months ago
Visualization Schemas for Flexible Information Visualization
Relational databases provide significant flexibility to organize, store, and manipulate an infinite variety of complex data collections. This flexibility is enabled by the concept...
Chris North, Nathan Conklin, Varun Saini
IADIS
2004
13 years 11 months ago
OLAP in enterprise decision modelling
This paper describes the application of online analytical processing (OLAP) in the field of data mining. We discuss knowledge discovery in enterprise databases as well as data war...
Perihan Kilimci, Bora Gökçe, Oya Kalip...
JDCTA
2010
152views more  JDCTA 2010»
13 years 4 months ago
Spatial Clustering Algorithm Based on Hierarchical-Partition Tree
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
Zhongzhi Li, Xuegang Wang