Clustering of the multi-value documents based on probabilistic features association mechanism

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is becoming increasingly difficult to cluster multi-valued data in data mining because of the multiple data interval values of individual functions. Identifying a clustering model that is appropriate for these disguised multi-valued data deployments in data analysis applications is an open problem. To answer this question, this paper proposes a feature selection based on the probabilistic features association mechanism (PFAM). The problem is mainly due to the difficulty in identifying the class information and the multiple values for each individual features. This work explores the problem of unsupervised feature selection through computing the probabilistic association score and multi-value data reformation for effective clustering in multivariate datasets. By minimizing a reformation clustering error, it can conserve together the degree of similarity and the categorization information of the actual data contents. The proposed approach is evaluated the clustering purity and Normalized Mutual Information on multivariate document datasets. The experimental evaluation shows the improvisation of the proposed approach.

Cite

CITATION STYLE

APA

Gopala Krishna, P., & Lalitha Bhaskari, D. (2019). Clustering of the multi-value documents based on probabilistic features association mechanism. International Journal of Innovative Technology and Exploring Engineering, 9(1), 1576–1581. https://doi.org/10.35940/ijitee.A4538.119119

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free