scispace - formally typeset
Open AccessBook

Algorithms for clustering data

Reads0
Chats0
About
The article was published on 1988-01-01 and is currently open access. It has received 8586 citations till now. The article focuses on the topics: Cluster analysis & Correlation clustering.

read more

Citations
More filters
Proceedings ArticleDOI

A music recommendation system based on music data grouping and user interests

TL;DR: The Music Recommendation System (MRS) is designed to provide a personalized service of music recommendation, which is based on the favorite degrees of the users to the music groups.
Journal ArticleDOI

Spatiotemporal Data Mining: A Computational Perspective

TL;DR: This survey reviews recent computational techniques and tools in spatiotemporal data mining and provides comprehensive coverage of computational approaches for various pattern families, focusing on several major pattern families.
Journal ArticleDOI

Query by video clip

TL;DR: Two schemes are proposed: retrieval based on key frames follows the traditional approach of identifying shots, computing key frames from a video, and then extracting image features around the key frames, and retrieval using sub-sampled frames is based on matching color and texture features of the sub-Sampled frames.
Journal ArticleDOI

Analysis of agriculture data using data mining techniques: application of big data

TL;DR: This paper focuses on the analysis of the agriculture data and finding optimal parameters to maximize the crop production using data mining techniques like PAM, CLARA, DBSCAN and Multiple Linear Regression.
Journal ArticleDOI

GAPS: A clustering method using a new point symmetry-based distance measure

TL;DR: The proposed GA with point symmetry (GAPS) distance based clustering algorithm is able to detect any type of clusters, irrespective of their geometrical shape and overlapping nature, as long as they possess the characteristic of symmetry.
References
More filters
Book

Clustering Algorithms

Journal ArticleDOI

Shortest connection networks and some generalizations

TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
Journal ArticleDOI

An examination of procedures for determining the number of clusters in a data set

TL;DR: A Monte Carlo evaluation of 30 procedures for determining the number of clusters was conducted on artificial data sets which contained either 2, 3, 4, or 5 distinct nonoverlapping clusters to provide a variety of clustering solutions.
Journal ArticleDOI

SLINK: An optimally efficient algorithm for the single-link cluster method

TL;DR: Sibson gives an O(n 2) algorithm for single-linkage clustering, and proves that this algorithm achieves the theoretically optimal lower time bound for obtaining a single- linkage dendrogram.