Detecting significant distinguishing sets among bi-clusters

Authors:
Faris Alqadah;Raj Bhatnagar
Affiliations:
Universtiy of Cincinnati, Cincinnati, OH, USA;Universtiy of Cincinnati, Cincinnati, OH, USA
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 4
Cited 0

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Biclustering Algorithms for Biological Data Analysis: A Survey

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure

IEEE Transactions on Knowledge and Data Engineering
A Lattice-Based Model for Recommender Systems

ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets; which seeks to find sets of objects or attributes that induce the most incremental change between adjacent bi-clusters of a binary dataset. Viewing the lattice of bi-clusters formed within a data set as a weighted directed graph, we mine the most significant distinguishing sets by growing a maximal-cost spanning tree of the lattice.