A partition clustering algorithm for transaction database based on fcm

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

Abstract

Large institutions usually have accumulated lots of transaction databases, which refer to multi-database. The effective method for acquiring useful knowledge from the multi-database is to classify them first, and then to mining. Usually, the technology of multi-database classification includes classifying and clustering. This article proposes a partition clustering algorithm to classify multi- database based on FCM. In the algorithm, a membership degree matrix is constructed firstly. And then, in the process of classifying, adjust the matrix to obtain a desired clustering result. Experiments show that our method is reasonable and effective.

Cite

CITATION STYLE

APA

Zhou, M., Cuan, Y., Yuan, D., & Wen, Y. (2014). A partition clustering algorithm for transaction database based on fcm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8933, 655–666. https://doi.org/10.1007/978-3-319-14717-8_51

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