Sciweavers

436 search results - page 23 / 88
» Automatic Subspace Clustering of High Dimensional Data for D...
Sort
View
CIKM
2003
Springer
14 years 27 days ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
ISCA
2007
IEEE
217views Hardware» more  ISCA 2007»
13 years 7 months ago
Parallel Processing of High-Dimensional Remote Sensing Images Using Cluster Computer Architectures
Hyperspectral sensors represent the most advanced instruments currently available for remote sensing of the Earth. The high spatial and spectral resolution of the images supplied ...
David Valencia, Antonio Plaza, Pablo Martín...
JMLR
2002
137views more  JMLR 2002»
13 years 7 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
GFKL
2004
Springer
137views Data Mining» more  GFKL 2004»
14 years 1 months ago
Density Estimation and Visualization for Data Containing Clusters of Unknown Structure
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
Alfred Ultsch
PAKDD
2001
ACM
148views Data Mining» more  PAKDD 2001»
14 years 2 days ago
Scalable Hierarchical Clustering Method for Sequences of Categorical Values
Data clustering methods have many applications in the area of data mining. Traditional clustering algorithms deal with quantitative or categorical data points. However, there exist...
Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzew...