Sciweavers

477 search results - page 13 / 96
» Clustering Complex Data with Group-Dependent Feature Selecti...
Sort
View
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
15 years 5 months ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...
SSDBM
2007
IEEE
110views Database» more  SSDBM 2007»
15 years 6 months ago
On Exploring Complex Relationships of Correlation Clusters
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
JMLR
2010
182views more  JMLR 2010»
14 years 6 months ago
Quadratic Programming Feature Selection
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
Irene Rodriguez-Lujan, Ramón Huerta, Charle...
NIPS
2004
15 years 1 months ago
The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
Robert Jenssen, Deniz Erdogmus, José Carlos...
ML
2002
ACM
128views Machine Learning» more  ML 2002»
14 years 11 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee