Sciweavers

477 search results - page 31 / 96
» Clustering Complex Data with Group-Dependent Feature Selecti...
Sort
View
INCDM
2010
Springer
125views Data Mining» more  INCDM 2010»
15 years 1 months ago
Web-Site Boundary Detection
Defining the boundaries of a web-site, for (say) archiving or information retrieval purposes, is an important but complicated task. In this paper a web-page clustering approach to...
Ayesh Alshukri, Frans Coenen, Michele Zito
ADC
2006
Springer
120views Database» more  ADC 2006»
15 years 5 months ago
Approximate data mining in very large relational data
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
James C. Bezdek, Richard J. Hathaway, Christopher ...
ICML
2008
IEEE
16 years 18 days ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
ICFP
2006
ACM
15 years 11 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
APWEB
2006
Springer
15 years 3 months ago
Generalized Projected Clustering in High-Dimensional Data Streams
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
Ting Wang