• Study Resource
  • Explore
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
Automatic Subspace Clustering of High Dimensional Data for Data
Automatic Subspace Clustering of High Dimensional Data for Data

Chapter 11. Cluster Analysis: Advanced Methods
Chapter 11. Cluster Analysis: Advanced Methods

11ClusAdvanced
11ClusAdvanced

Detection of Outliers and Hubs Using Minimum Spanning Tree
Detection of Outliers and Hubs Using Minimum Spanning Tree

... are detected using a given distance measure on feature space, a point q in a data set is an outlier with respect to the parameters M and d, if there are less than M points within the distance d from q, where the values of M and d are determined by the user. The problem in distance–based approach is ...
L10: Trees and networks Data clustering
L10: Trees and networks Data clustering

Swarm Intelligence Algorithms for Data Clustering
Swarm Intelligence Algorithms for Data Clustering

... globe are coming up with new algorithms, on a regular basis, to meet the increasing complexity of vast real-world datasets. A comprehensive review of the state-of-the-art clustering methods can be found in (Xu and Wunsch, 2005) and (Rokach and Maimon, 2005). Data mining is a powerful new technology, ...
New Outlier Detection Method Based on Fuzzy Clustering
New Outlier Detection Method Based on Fuzzy Clustering

... authors use a hierarchical clustering technique. A similar approach was reported in [34]. Acuna and Rodriguez [33] performed the PAM algorithm [16] followed by the Separation Technique (henceforth, the method will be termed PAMST). The separation of a cluster A is defined as the smallest dissimilari ...
Preface - Society for Industrial and Applied Mathematics
Preface - Society for Industrial and Applied Mathematics

Recent Techniques of Clustering of Time Series Data: A
Recent Techniques of Clustering of Time Series Data: A

Subspace Clustering of Microarray Data based on Domain
Subspace Clustering of Microarray Data based on Domain

Scalable Sequential Spectral Clustering
Scalable Sequential Spectral Clustering

ppt
ppt

HG2212691273
HG2212691273

COMP 290 – Data Mining Final Project
COMP 290 – Data Mining Final Project

What Is Clustering?
What Is Clustering?

BJ24390398
BJ24390398

Novel Approach for Heart Disease verdict Using Data Mining
Novel Approach for Heart Disease verdict Using Data Mining

... Abstract: Nowadays Heart Disease is one of the main causes of death in and around countries. Several studies with different technologies have been made in diagnosis and treatment ofheart disease, which includes association rules, logistic regression, fuzzy modeling, Decision tree and neural network. ...
Distributed approximate spectral clustering for large
Distributed approximate spectral clustering for large

An Improved Clustering Algorithm of Tunnel Monitoring Data for
An Improved Clustering Algorithm of Tunnel Monitoring Data for

IOSR Journal of Computer Engineering (IOSR-JCE)
IOSR Journal of Computer Engineering (IOSR-JCE)

Concept Ontology for Text Classification
Concept Ontology for Text Classification

Foundations of Perturbation Robust Clustering
Foundations of Perturbation Robust Clustering

Towards Cohesive Anomaly Mining Yun Xiong Yangyong Zhu Philip S. Yu
Towards Cohesive Anomaly Mining Yun Xiong Yangyong Zhu Philip S. Yu

Full Text - Universitatea Tehnică "Gheorghe Asachi" din Iaşi
Full Text - Universitatea Tehnică "Gheorghe Asachi" din Iaşi

Application of Fuzzy Classification in Bankruptcy Prediction Zijiang Yang and Guojun Gan
Application of Fuzzy Classification in Bankruptcy Prediction Zijiang Yang and Guojun Gan

< 1 ... 35 36 37 38 39 40 41 42 43 ... 88 >

Nearest-neighbor chain algorithm



In the theory of cluster analysis, the nearest-neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be clustered and an amount of time linear in the number of distinct distances between pairs of points. The main idea of the algorithm is to find pairs of clusters to merge by following paths in the nearest neighbor graph of the clusters until the paths terminate in pairs of mutual nearest neighbors. The algorithm was developed and implemented in 1982 by J. P. Benzécri and J. Juan, based on earlier methods that constructed hierarchical clusterings using mutual nearest neighbor pairs without taking advantage of nearest neighbor chains.
  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report