Sciweavers

538 search results - page 8 / 108
» Dimension induced clustering
Sort
View
CLA
2007
13 years 9 months ago
Inducing Decision Trees via Concept Lattices
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...
Radim Belohlávek, Bernard De Baets, Jan Out...
FLAIRS
2001
13 years 9 months ago
A Lattice-Based Approach to Hierarchical Clustering
The paper presents an approach to hierarchical clustering based on the use of a least general generalization (lgg) operator to induce a lattice structure of clusters and a categor...
Zdravko Markov
INFOVIS
1998
IEEE
14 years 20 days ago
Similarity Clustering of Dimensions for an Enhanced Visualization of Multidimensional Data
The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recur...
Mihael Ankerst, Stefan Berchtold, Daniel A. Keim
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
14 years 1 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
FOCM
2007
55views more  FOCM 2007»
13 years 8 months ago
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theo...
Marc Giusti, Grégoire Lecerf, Bruno Salvy, ...