Partitioned-based Fuzzy Clustering to Learn Documents' Triadic Similarity
With the development of the Web and the high availability of storage spaces, more and more documents become accessible. For that reason, similarity learning suffers from a scalability problem in both memory use and computational time when a data set is large. This paper provides a fuzzy triadic similarity measure to calculate memberships in a context of document co-clustering. It allows computing simultaneously fuzzy co-similarity matrices between documents/sentences and sentences/words. Each one is built on the basis of the others. The proposed model is extended to tackle the problem of large data sets by a splitting architecture which deals with a new fuzzy triadic similarity to parallelize both memory use and computation on distributed computers. This architecture is based on fuzzy clustering for partitioning data sets into similar groups (or clusters) in order to create more coherent sub-sets.
How to Cite
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.
This journal has been awarded the SPARC Europe Seal for Open Access Journals (What's this?)