Sciweavers

694 search results - page 8 / 139
» On the Dimensions of Data Complexity through Synthetic Data ...
Sort
View
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 16 days ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
ICDT
2001
ACM
124views Database» more  ICDT 2001»
14 years 1 days ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
INFOVIS
2005
IEEE
14 years 1 months ago
Parallel Sets: Visual Analysis of Categorical Data
The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical...
Fabian Bendix, Robert Kosara, Helwig Hauser
GLOBECOM
2009
IEEE
14 years 2 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
28
Voted
SBBD
2000
168views Database» more  SBBD 2000»
13 years 9 months ago
Fast Feature Selection Using Fractal Dimension
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
Caetano Traina Jr., Agma J. M. Traina, Leejay Wu, ...