Mining Biclusters of Similar Values with Triadic Concept Analysis

Details Mining Biclusters of Similar Values with Triadic Concept Analysis Mining Biclusters of Similar Values with Triadic Concept Analysis

2011-11-14

arxiv.org/abs/1111.3270v1

Computer Science

Data Structures and Algorithms

Concept Lattices and their Applications (CLA) (2011)

Scientific paper

Biclustering numerical data became a popular data-mining task in the beginning of 2000's, especially for analysing gene expression data. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non redundant enumeration of such patterns, which is a well-known intractable problem, while no formal framework exists. In this paper, we introduce important links between biclustering and formal concept analysis. More specifically, we originally show that Triadic Concept Analysis (TCA), provides a nice mathematical framework for biclustering. Interestingly, existing algorithms of TCA, that usually apply on binary data, can be used (directly or with slight modifications) after a preprocessing step for extracting maximal biclusters of similar values.

Affiliated with

Also associated with

No associations

Rating

Mining Biclusters of Similar Values with Triadic Concept Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mining Biclusters of Similar Values with Triadic Concept Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mining Biclusters of Similar Values with Triadic Concept Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218829