2015
DOI: 10.3103/s0005105515010057
|View full text |Cite
|
Sign up to set email alerts
|

A single-pass triclustering algorithm

Abstract: As the popularity of the field of big data continues to rise, the problem of the development of effi cient algorithms with low time complexity and that ability to be parallelized is more and more frequently posed. This work is aimed at the development of an efficient single pass algorithm for the triclustering of binary data that is suitable for use in the field of big data. As a result, a single pass serial online OAC triclus tering algorithm (triclustering of object-attribute-condition) was obtained. This al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 27 publications
(26 reference statements)
0
3
0
Order By: Relevance
“…Finally, following the increasing popularity of the big data field, a novel, efficient algorithm, in terms of time and memory, with reduced computational cost, was presented in [29]. The authors also affirmed that the algorithm can be easily parallelized to become adapted to the new big data programming paradigms.…”
Section: Use Of Triclusteringmentioning
confidence: 92%
“…Finally, following the increasing popularity of the big data field, a novel, efficient algorithm, in terms of time and memory, with reduced computational cost, was presented in [29]. The authors also affirmed that the algorithm can be easily parallelized to become adapted to the new big data programming paradigms.…”
Section: Use Of Triclusteringmentioning
confidence: 92%
“…More recently, Tribox, SpecTric, OAC-triclustering (based on primes of pairs), and Krimp-triclustering were proposed to overcome some of the drawbacks of previous algorithms, such as pattern explosion and quality Mirkin and Kramarenko 2011;Yurov and Ignatov 2017). As primebased operators satisfy single-pass and linearity search conditions, OAC-triclustering was recently extended within a new algorithm, here referred to as Online OAC, that further explores efficiency gains and can be parallelized (Gnatyshak 2015). A generalization of this task for the discovery of n-ary formal concepts from n-dimensional data was proposed by Cerf et al (2009) with the Data-Peeler algorithm and later extended to tolerate noise (Cerf et al 2013).…”
Section: Exhaustive Approachesmentioning
confidence: 99%
“…Triclustering has been recently applied for the analysis of folksonomies, text, or unstructured (web) data (Gnatyshak 2015; to identify user-sensitive consensus in sourceuser-tag data and correlated content cubes measuring the frequency of categories/words across text segments.…”
Section: Other Applicationsmentioning
confidence: 99%