Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Triclustering algorithms for three-dimensional data analysis: a comprehensive survey
Henriques R., Madeira S. ACM Computing Surveys51 (5):1-43,2018.Type:Article
Date Reviewed: Jan 18 2019

The rapid increase in data streams poses significant challenges to their interpretation. Algorithms increasingly target 3D datasets, which plot observations, attributes, and contexts, to capture patterns in the fields of medicine and social networks. One popular approach is that of biclustering, which isolates subsets of data by eliminating one of the dimensions to achieve conceptual simplicity and computational complexity; however, it does so at the cost of completeness and effectiveness. As the authors note, while the more comprehensive approach of triclustering has received scrutiny, it lacks structure. Not only do the authors provide the first comprehensive review of triclustering literature, they go beyond that to contribute to the field by formalizing the triclustering method, comparing it to competing methods, developing a taxonomy and principles for assessing implementations of triclustering, and reviewing practical applications.

Two sections are especially informative and form the article’s core. One is the formulation of the problem that triclustering addresses. The authors effectively present the method using multicolored and 3D illustrations. The other is a comprehensive, concisely written review of triclustering algorithms, including greedy, stochastic, and exhaustive approaches.

The authors complement their theoretical concerns with an analysis of triclustering in real-world areas such as biology, medicine, and social data. This balances out the article’s conceptual concerns.

Researchers in machine learning and in biology, medicine, or social networking will find this article valuable.

Reviewer:  Marlin Thomas Review #: CR146385 (1904-0129)
Bookmark and Share
  Featured Reviewer  
 
Clustering (H.3.3 ... )
 
 
Statistical Methods (D.2.4 ... )
 
 
Introductory And Survey (A.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Clustering": Date
Concepts and effectiveness of the cover-coefficient-based clustering methodology for text databases
Can F. (ed), Ozkarahan E. ACM Transactions on Database Systems 15(3): 483-517, 1990. Type: Article
Dec 1 1992
A parallel algorithm for record clustering
Omiecinski E., Scheuermann P. ACM Transactions on Database Systems 15(3): 599-624, 1990. Type: Article
Nov 1 1992
Organization of clustered files for consecutive retrieval
Deogun J., Raghavan V., Tsou T. ACM Transactions on Database Systems 9(4): 646-671, 1984. Type: Article
Jun 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy