Overlapping matrix pattern visualization: A hypergraph approach

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 313-322

  Jin, Ruoming ^a   Xiang, Yang ^a   Fuhry, David ^a   Dragan, Feodor F ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MATRICES; DATA SETS; EXPERIMENTAL EVALUATION; HYPERGRAPH; ITERATIVE ALGORITHM; LINEAR ARRANGEMENTS; LOCAL MINIMUMS; MATRIX; NP-HARDNESS; ORDERING ALGORITHMS; PATTERN VISUALIZATION; SUB-MATRICES; VISUAL DATA MINING;

ALGORITHMS; INFORMATION MANAGEMENT; MINING; SET THEORY; VISUALIZATION;

MATRIX ALGEBRA;

EID: 67049169372     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.102     Document Type: Conference Paper

References (28)

1. D. Adolphson and T. C. Hu. Optimal linear ordering. SIAM Journal on Applied Mathematics, 25(3):403-423, 1973.
2. D. L. Adolphson. Single machine job sequencing with precedence constraints. SIAM Journal on Computing, 6(1):40-54, 1977.
3. R. Bar-Yehuda, G. Even, J. Feldman, and J. Naor. Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems. J. Graph Algorithms Appl., 5(4), 2001.
4. C. Brunk, J. Kelly, and R. Kohavi. Mineset: An integrated system for data access, visual data mining, and analytical data mining,. In Proceedings of the Third Conference on Knowledge Discovery and Data Mining (KDD-97), 1997.
5. V. Chandola and V. Kumar. Summarization - compressing data into an informative representation. Knowl. Inf. Syst., 12(3):355-378, 2007.
6. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified np-complete problems. In STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computing, pages 47-63, New York, NY, USA, 1974. ACM.
7. A. George and J. W. Liu. Computer Solution of Large Sparse Positive Definite. Prentice Hall Professional Technical Reference, 1981.
8. G. Grothaus, A. Mufti, and T. Murali. Automatic layout and visualization of biclusters. 1:1748-7188, 2006.
9. L. H. Harper. Optimal assignments of numbers to vertices. Journal of the Society for Industrial and Applied Mathematics, 12(1):131-135, 1964.
10. M. Juvan and B. Mohar. Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math., 36(2):153-168, 1992.
11. D. A. Keim. Information visualization and visual data mining. IEEE Transactions on Visualization and Computer Graphics, 08(1):1-8, 2002. (Pubitemid 34573478)
12. Y. Koren and D. Harel. A multi-scale algorithm for the linear arrangement problem. In WG '02: Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 296-309, London, UK, 2002. Springer-Verlag. (Pubitemid 36140608)
13. C. Krumpelman and J. Ghosh. Matching and visualization of multiple overlapping clusterings of microarray data. In IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology, CIBCB'07, pages 121-126, 2007.
14. S. C. Madeira and A. L. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 1(1):24-45, 2004.
15. G. Mitchison and R. Durbin. Optimal numberings of an n n array. SIAM J. Algebraic Discrete Methods, 7(4):571-582, 1986.
16. C. Mueller, B. Martin, and A. Lumsdaine. A comparison of vertex ordering algorithms for large graph visualization. In APVIS, pages 141-148, 2007. (Pubitemid 47133248)
17. J. Pach, F. Shahrokhi, and M. Szegedy. Applications of the crossing number. In SCG '94: Proceedings of the tenth annual symposium on Computational geometry, pages 198-202, New York, NY, USA, 1994. ACM.
18. J. Petit. Combining spectral sequencing and parallel simulated annealing for the minla problem. Parallel Processing Letters, 13(1):77-91, 2003.
19. J. Petit. Experiments on the minimum linear arrangement problem. ACM Journal of Experimental Algorithms, 8, 2003.
20. T. Poranen. A genetic hillclimbing algorithm for the optimal linear arrangement problem. Fundam. Inf., 68(4):333-356, 2005.
21. S. Rao and A. W. Richa. New approximation techniques for some ordering problems. In SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pages 211-218, Philadelphia, PA, USA, 1998. Society for Industrial and Applied Mathematics.
22. R. Ravi, A. Agrawal, and P. N. Klein. Ordering problems approximated: Singleprocessor scheduling and interval graph completion. In ICALP '91: Proceedings of the 18th International Colloquium on Automata, Languages and Programming, pages 751-762, London, UK, 1991. Springer-Verlag.
23. I. Safro, D. Ron, and A. Brandt. Graph minimum linear arrangement by multilevel weighted edge contractions. J. Algorithms, 60(1):24-41, 2006. (Pubitemid 43737249)
24. A. Strehl and J. Ghosh. Relationship-based clustering and visualization for high-dimensional data mining. INFORMS J. on Computing, 15(2):208-230, 2003. (Pubitemid 39042729)
25. E. Vityaev and B. Kovalerchuk. Inverse visualization in data mining, 2002.
26. J. Wang and G. Karypis. On efficiently summarizing categorical databases. Knowl. Inf. Syst., 9(1):19-37, 2006. (Pubitemid 43231145)
27. Y. Xiang, R. Jin, D. Fuhry, and F. F. Dragan. Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. In KDD, pages 758-766, 2008.
28. K. Zhao, B. Liu, T. M. Tirpak, and W. Xiao. A visual data mining framework for convenient identification of useful knowledge. In ICDM '05: Proceedings of the Fifth IEEE International Conference on Data Mining, pages 530-537, 2005. (Pubitemid 47385735)