Sciweavers

628 search results - page 50 / 126
» A new approach to data driven clustering
Sort
View
ESANN
2004
14 years 11 months ago
Fast semi-automatic segmentation algorithm for Self-Organizing Maps
Self-Organizing Maps (SOM) are very powerful tools for data mining, in particular for visualizing the distribution of the data in very highdimensional data sets. Moreover, the 2D m...
David Opolon, Fabien Moutarde
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
15 years 10 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
DOLAP
2004
ACM
15 years 3 months ago
Developing a characterization of business intelligence workloads for sizing new database systems
Computer system sizing involves estimating the amount of hardware resources needed to support a new workload not yet deployed in a production environment. In order to determine th...
Ted J. Wasserman, Patrick Martin, David B. Skillic...
ISNN
2011
Springer
14 years 19 days ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
CIKM
2008
Springer
14 years 11 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...