New clustering methods for interval data
Two new clustering methods are proposed for multivariate interval data. They are modifications of the dynamic \(k\)-clustering algorithm based on minimization of distances from elements of the cluster to its prototype (centre). The number \(k\) of clusters is fixed. A sum of Hausdorff distances between intervals is used in the first modification and a specific dissimilarity measure based on a discretization of the intervals is used in the second modification. These algorithms are applied to data on monthly minimal and maximal daily average temperatures in 60 meteorological stations in China.
- Analysis of symbolic data. Exploratory methods for extracting statistical information from complex data
- Computing the minimum Hausdorff distance between two point sets on a line under translation
- Histograms in symbolic data analysis
- scientific article; zbMATH DE number 4205773 (Why is no real title available?)
- scientific article; zbMATH DE number 3673159 (Why is no real title available?)
- scientific article; zbMATH DE number 3518115 (Why is no real title available?)
- scientific article; zbMATH DE number 1975304 (Why is no real title available?)
- scientific article; zbMATH DE number 2034559 (Why is no real title available?)
- scientific article; zbMATH DE number 1535765 (Why is no real title available?)
- Partitional clustering algorithms for symbolic interval data based on single adaptive distances
- A new approach to solving data clusterization problems
- Data generation processes and statistical management of interval data
- Exploratory data analysis of interval-valued symbolic data with matrix visualization
- A new robust model of one-class classification by interval-valued training data using the triangular kernel
- A hierarchical clustering method for random intervals based on a similarity measure
- Clustering communities using interval K-means
- On the construction of an aggregated measure of the development of interval data
- Clustering of interval time series
- Kernel fuzzy \(c\)-means with automatic variable weighting
- Binary classification SVM-based algorithms with interval-valued training data using triangular and Epanechnikov kernels
- Classification of multivariate objects using interval quantile classes
- Possibilistic Clustering Methods for Interval-Valued Data
- On Central Tendency and Dispersion Measures for Intervals and Hypercubes
- scientific article; zbMATH DE number 2034559 (Why is no real title available?)
- Cluster analysis of census data using the symbolic data approach
- scientific article; zbMATH DE number 804124 (Why is no real title available?)
- Far beyond the classical data models: symbolic data analysis
- Clustering and Validation of Interval Data
- Advances in Artificial Intelligence – SBIA 2004
- A new clustering method for interval data
- Similarity measures for interval-valued fuzzy sets based on average embeddings and its application to hierarchical clustering
- Fuzzy K-means clustering algorithms for interval-valued data based on adaptive quadratic distances
- Comparing two clustering methods for interval-valued data
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning
- Self-organizing map for symbolic data
- Kernel-based hard clustering methods in the feature space with automatic variable weighting
- Dynamic clustering for interval data based on L₂ distance
- Clustering reduced interval data using Hausdorff distance
- Efficient indexing of interval time sequences
This page was built for publication: New clustering methods for interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880906)
