Pith. sign in

REVIEW

Parallel architectures for fuzzy triadic similarity learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1312.6273 v1 pith:VO7XY6WO submitted 2013-12-21 cs.DC cs.LGstat.ML

classification cs.DCcs.LGstat.ML
keywords similarityfuzzyparallelarchitecturessetscomputationcomputingdocuments
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In a context of document co-clustering, we define a new similarity measure which iteratively computes similarity while combining fuzzy sets in a three-partite graph. The fuzzy triadic similarity (FT-Sim) model can deal with uncertainty offers by the fuzzy sets. Moreover, with the development of the Web and the high availability of storage spaces, more and more documents become accessible. Documents can be provided from multiple sites and make similarity computation an expensive processing. This problem motivated us to use parallel computing. In this paper, we introduce parallel architectures which are able to treat large and multi-source data sets by a sequential, a merging or a splitting-based process. Then, we proceed to a local and a central (or global) computing using the basic FT-Sim measure. The idea behind these architectures is to reduce both time and space complexities thanks to parallel computation.

Discussion (0). Continue with ORCID to comment.

Pith tools