TITLE

Combining PSO cluster and nonlinear mapping algorithm to perform clustering performance analysis: take the enterprise financial alarming as example

AUTHOR(S)
Pan, Wen-Tsao
PUB. DATE
October 2011
SOURCE
Quality & Quantity;Oct2011, Vol. 45 Issue 6, p1291
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Algorithm by simulating biological intelligence concept with application in the optimization issue is still in the emergent stage. Among them, Particle Swarm Optimization Algorithm is a concept and method that has group intelligence. Using the exploring and development feature of particle swarm, the best solution of the entire domain is searched in the question space. However, Clustering Analysis has an objective to plan the data set according to certain principle into several sub-sets. Due to the practicability of Clustering Analysis, many scholars propose different clustering algorithms to be used by the researchers. Therefore, in this article, Particle Swarm Optimization Algorithm is adopted to self-write Clustering Analysis program. Then Fuzzy Sammon Mapping nonlinear mapping algorithm is associated to perform clustering performance and classificaton capability assessment. From the test result of test data of enterprise's financial alarming, it can be seen that Particle Swarm Clustering Analysis can obtain good clustering performance, and good classification capability can be obtained too.
ACCESSION #
66550321

 

Related Articles

  • A New Hybrid Algorithm Based on Artificial fishes swarm Optimization and K-means for Cluster Analysis. Neshat, Mehdi; Yazdani, Danial; Gholami, Elham; Masoumi, Azra; Sargolzae, Mehdi // International Journal of Computer Science Issues (IJCSI);Jul2011, Vol. 8 Issue 4, p251 

    Data clustering has been used in different fields such as machine learning, data mining, wireless sensory networks and pattern recognition. One of the most well-known clustering methods is K-means which has been used effectively in many of clustering problems. But this algorithm has problems...

  • Data Clustering Using Chaotic Particle Swarm Optimization. Li-Yeh Chuang; Yu-Da Lin; Cheng-Hong Yang // IAENG International Journal of Computer Science;2012, Vol. 39 Issue 2, p208 

    Clustering is an important analysis tool employed in data statistics. Identification of the structure of large-scale data has become an increasingly important topic in data mining problem. We propose Gauss chaotic map particle swarm optimization (GaussPSO) method for clustering, which uses a...

  • Automatically Affinity Propagation Clustering using Particle Swarm.  // Journal of Computers;Nov2010, Vol. 5 Issue 11, p1731 

    No abstract available.

  • Optimization of the Fuzzy C-Means Algorithm using Evolutionary Methods. Castillo, Oscar; Rubio, Elid; Soria, Jose; Naredo, Enrique // Engineering Letters;2012, Vol. 20 Issue 1, p61 

    This paper presents the optimization of the Fuzzy C-Means algorithm by evolutionary or bio-inspired methods, this in order to automatically find the optimal number of clusters and the weight exponent. Optimization methods used to realization of this paper were genetic algorithms and particle...

  • Particle swarm optimizer for variable weighting in clustering high-dimensional data. Yanping Lu; Shengrui Wang; Shaozi Li; Changle Zhou // Machine Learning;Jan2011, Vol. 82 Issue 1, p43 

    In this paper, we present a particle swarm optimizer (PSO) to solve the variable weighting problem in projected clustering of high-dimensional data. Many subspace clustering algorithms fail to yield good cluster quality because they do not employ an efficient search strategy. In this paper, we...

  • A Study on Performance Evaluation Model of Individual Knowledgesharing. Lijun Song; Ningyu Zhao // Journal of Convergence Information Technology;Mar2012, Vol. 7 Issue 4, p238 

    To evaluate the knowledge-sharing performance in the customer collaborative innovation organization based on subtractive clustering and Fuzzy Neural Network (SC-FNN), an knowledgesharing performance evaluation model was proposed. Firstly, the process of Knowledge-sharing was researched, and the...

  • A COMPARATIVE ANALYSIS BETWEEN K-MEDOIDS AND FUZZY C-MEANS CLUSTERING ALGORITHMS FOR STATISTICALLY DISTRIBUTED DATA POINTS. VELMURUGAN, T.; SANTHANAM, T. // Journal of Theoretical & Applied Information Technology;5/15/2011, Vol. 27 Issue 1, p19 

    Data clustering is a process of putting similar data into groups. A clustering algorithm partitions a data set into several groups such that the similarity within a group is larger than among groups. In the field of data mining, various clustering algorithms are proved for their clustering...

  • Categorical Data Clustering using Cosine based similarity for Enhancing the Accuracy of Squeezer Algorithm. Ranjani, R.; Elavarasi, S.Anitha; J.Akilandeswari // International Journal of Computer Applications;May2012, Vol. 45, p41 

    Clustering categorical data is the major challenge in data mining. Direct comparison of categorical data is not possible as in numerical data, understanding the province of categorical data help to form good quality clusters. This paper presents an algorithm Enhanced Squeezer, which incorporates...

  • Clustering Categorical Data -- Study of Mining Tools for Data Labeling. Narayana, M. Sathya; Babu, N. Siva Ram; Prasad, B. V. V. S.; Kumar, B. Suresh // International Journal of Advanced Research in Computer Science;Jul2011, Vol. 2 Issue 4, p372 

    Cluster analysis sampling has been recognized as a best technique to improve the efficiency of clustering. However, with sampling applied to those points which are not sampled will not have their labels after the normal process. Although there is a straightforward approach in the numerical...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics