Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data

DOI10.1016/J.PATCOG.2006.06.021zbMATH Open1103.68782OpenAlexW2167118705WikidataQ59538698 ScholiaQ59538698MaRDI QIDQ850147FDOQ850147

Stefano Rovetta, Francesco Masulli

Publication date: 15 November 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.06.021

Recommendations

• Clustering high dimension, low sample size data using the maximal data piling distance
• Approximate \(k\)-closest-pairs in large high-dimensional data sets
• scientific article
• scientific article; zbMATH DE number 2112095
• A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities
• scientific article; zbMATH DE number 6699826

zbMATH Keywords

high-dimensional data analysisdata clusteringDNA microarray data analysissimilarity-based clustering

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• Finding Groups in Data
• Model-Based Gaussian and Non-Gaussian Clustering
• Title not available (Why is that?)
• A deterministic annealing approach to clustering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Measures of Association for Cross Classifications
• Hierarchical clustering schemes
• The Dissimilarity Representation for Pattern Recognition
• 10.1162/15324430260185592
• Enumeration of Seven-Argument Threshold Functions
• Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of the learnable
• On clusterings
• Title not available (Why is that?)
• Self-organizing maps.
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• Detection and Characterization of Cluster Substructure II. Fuzzy c-Varieties and Convex Combinations Thereof
• Constructing hierarchical set systems

Cited In (4)

• A new clustering algorithm for coordinate-free data
• A PROBABILISTIC SELF-ORGANIZING MAP FOR BINARY DATA TOPOGRAPHIC CLUSTERING
• A hierarchical hesitant fuzzy K-means clustering algorithm
• A portmanteau local feature discrimination approach to the classification with high-dimensional matrix-variate data

Uses Software

• UCI-ml

This page was built for publication: Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850147)