Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
A Robust Competitive Clustering Algorithm With Applications in Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cure: an efficient clustering algorithm for large databases
Information Systems
A Modified Version of the K-Means Algorithm with a Distance Based on Cluster Symmetry
IEEE Transactions on Pattern Analysis and Machine Intelligence
DEXA '00 Proceedings of the 11th International Workshop on Database and Expert Systems Applications
ACODF: a novel data clustering approach for data mining in large databases
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Unsupervised Anomaly Detection Using HDG-Clustering Algorithm
Neural Information Processing
An axis-shifted crossover-imaged clustering algorithm
WSEAS TRANSACTIONS on SYSTEMS
A deflected grid-based algorithm for clustering analysis
WSEAS Transactions on Computers
Normalized text font resemblance method aimed at document image page clustering
WSEAS Transactions on Computers
ANGEL: a new effective and efficient hybrid clustering technique for large databases
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
G-TREACLE: a new grid-based and tree-alike pattern clustering technique for large databases
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
KIDBSCAN: a new efficient data clustering algorithm
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Hi-index | 0.00 |
Data clustering plays an important role in various fields. Data clustering approaches have been designed in recent years. This investigation aims to present data clustering algorithm to identify potential musical instruments teachers. With a total of 5125 candidates registered respectively in 9 grades of Taiwan United Music Grade Test during 2000-2008. Moreover, this study proposes a new data clustering algorithm called MIDBSCAN and an existing well-known neural network called self-organizing map (SOM) to perform data clustering applications for discovering potential musical instruments teachers. The processing procedure of searching for neighbors (neighborhood data points) is very time consuming in the existing well-known DBSCAN and IDSCAN algorithms. Therefore, to shorten the time consumed, the proposed MIDBSCAN algorithm focuses lowering the number of expansion seeds added into the neighborhood data in this procedure, thus reducing the time cost of searching for neighbors. According to our simulation results, the proposed MIDBSCAN approach has low execution time cost, a maximum deviation in clustering correctness rate and a maximum deviation in noise data filtering rate. MIDBSCAN outperforms SOM in execution time cost. It is feasible to perform data clustering analysis in various data mining applications using the proposed MIDBSCAN algorithm.