Overlapping Matrix Pattern Visualization: A Hypergraph Approach
Ruoming Jin
Yang Xiang
Fuhry, D.
Dragan, F.F.
Dept. of Comput. Sci., Kent State Univ., Kent, OH;
This paper appears in: Data Mining, 2008. ICDM '08. Eighth IEEE International Conference on
Publication Date: 15-19 Dec. 2008
On page(s): 313-322
Location: Pisa,
ISSN: 1550-4786
ISBN: 978-0-7695-3502-9
INSPEC Accession Number: 10472163
Digital Object Identifier: 10.1109/ICDM.2008.102
Current Version Published: 2009-02-10
Abstract
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to best display these submatrices and their relationships? We find this problem can be converted to the hypergraph ordering problem, which generalizes the traditional minimal linear arrangement (or graph ordering) problem and then we are able to prove the NP-hardness of this problem. We propose a novel iterative algorithm which utilize the existing graph ordering algorithm to solve the optimal visualization problem. This algorithm can always converge to a local minimum. The detailed experimental evaluation using a set of publicly available transactional datasets demonstrates the effectiveness and efficiency of the proposed algorithm.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
