Sciweavers

1313 search results - page 108 / 263
» Data Discretization Unification
Sort
View
VISUALIZATION
1996
IEEE
14 years 2 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
ICDM
2010
IEEE
199views Data Mining» more  ICDM 2010»
13 years 8 months ago
Addressing Concept-Evolution in Concept-Drifting Data Streams
Abstract--The problem of data stream classification is challenging because of many practical aspects associated with efficient processing and temporal behavior of the stream. Two s...
Mohammad M. Masud, Qing Chen, Latifur Khan, Charu ...
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 10 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 5 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
COMPGEOM
2010
ACM
14 years 3 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park