Mining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein networks

Statistical Analysis and Data Mining

Volumn 2, Issue 4, 2009, Pages 255-273

  Sim, Kelvin ^a,b   Li, Jinyan ^b   Gopalkrishnan, Vivekanand ^b   Liu, Guimei ^c  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Bicliques; Bioinformatics; Finance; Graph mining

Indexed keywords

FINANCIAL MARKETS; GRAPH THEORY;

BICLIQUE; CO CLUSTERS; CORRELATED PAIRS; DATA MEMBERS; GRAPH MINING; MISSING DATA; NOVEL ALGORITHM; NOVEL APPLICATIONS; PROTEIN NETWORK; REAL-WORLD;

PROTEINS;

EID: 77950252178     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.10051     Document Type: Article

References (43)

1. H. Li, J. Li, and L. Wong, Discovery motif pairs at interaction sites from protein sequences on a proteome-wide scale, Bioinformatics 22(8) (2006), 989-996.
2. T. Murata, Discovery of user communities from web audience measurement data, In Proceedings of WI 2004, Beijing, China, 2004, 673-676.
3. W. Peng, C. Ding, T. Li, and T. Sun, Finding hotspots in document collection, In Proceedings of ICTAI 2007, Paris, France, 2007.
4. J. Li, G. Liu, H. Li, and L. Wong, Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms, IEEE Trans Knowl Data Eng 19(12) (2007), 1625-1637.
5. G. Alexe, S. Alexe, Y. Crama, S. Foldes, P. L. Hammer, and B. Simeone, Consensus algorithms for the generation of all maximal bicliques, Discrete Appl Math 145(1) (2004), 11-21.
6. J. Abello, M. G. C. Resende, and S. Sudarsky, Massive quasi-clique detection, In Proceedings of LATIN, Cancun, Mexico, 2002, 598-612.
7. D.Bu,Y.Zhao,L.Cai,H.Xue,X.Zhu,H.Lu, J. Zhang, S. Sun, L. Ling, N. Zhang, G. Li and R. Chen, Topological structure analysis of the protein-protein interaction network in budding yeast, Nucleic Acids Res 31(9) (2003), 2443-2450.
8. N. Mishra, D. Ron, and R. Swaminathan, A new conceptual clustering framework, J MachLearn Res 56(1-3) (2005), 115-151.
9. C. Yan, J. G. Burleigh, and O. Eulenstein, Identifying optimal incomplete phylogenetic data sets from sequence databases. Mol Phylogenet Evol 35 (2005), 528-535.
10. K. Sim, J. Li, V. Gopalkrishnan, and G. Liu, Mining maximal quasi-bicliques to co-cluster stocks and financial ratios for value investor. In Proceedings of the ICDM, Hong Kong, China, 2006, 1059-1063.
11. B. Graham and D. Dodd, Security Analysis. McGraw-Hill Professional, 1934.
12. P. Lynch and J. Rothchild, One Upon Wall Street: How to Use What You Already Know to Make Money in the Market. Simon & Schuster, 2000.
13. B. Martìn-del-Brìo and C. Serrano-Cinca, Self-organizing neural networks for the analysis and representation of data: Some financial cases, Neural Comput Appl 1(3) (1993), 193-206.
14. T. Eklund, B. Back, H. Vanharanta, and A. Visa, Assessing the feasibility of self-organizing maps for data mining financial information, In Proceedings of the ECIS, Gdańsk, Poland, 2002, 528-537.
15. C. Magnusson, A. Arppe, T. Eklund, A. Kloptchenko, B. Back, A. Visa, and H. Vanharanta, Combining collocational networks and self-organizing maps in analyzing quarterly reports, Inform Manage 42(4) (2005), 561-574.
16. L. Parsons, E. Haque, and H. Liu, Subspace clustering for high dimensional data: a review, SIGKDD Explor Newsl 6(1) (2004), 90-105.
17. Y. Cheng and G. M. Church, Biclustering of expression data, Proceedings of the Eighth International Conference on ISMB, San Diego, CA, USA, AAAI Press, 2000, 93-103.
18. I. S. Dhillon, Co-clustering documents and words using bipartite spectral graph partitioning, In Proceedings of KDD, San Francisco, CA, USA, 2001, 269-274.
19. A. H. Y. Tong, B. Drees, G. Nardelli, G. D. Bader, B. Brannetti, L. Castagnoli, M. Evangelista, S. Ferracuti, B. Nelson, S. Paoluzi, M. Quondam, A. Zucconi, C. W. V. Hogue, S. Fields, C. Boone and G. Cesareni, A combined experimental and computational strategy to define protein interaction networks for peptide recognition modules. Science 295 (2002), 321-324.
20. T. Chiang, D. Scholtens, D. Sarkar, R. Gentleman, and W. Huber, Coverage and error models of protein-protein interaction data by directed graph analysis, Genome Biol 8(9) (2007).
21. J. Li, H. Li, D. Soh, and L. Wong, A correspondence between maximal complete bipartite subgraphs and closed patterns, In Proceedings of PKDD, Porto, Portugal, 2005, 146-156.
22. J. Li, K. Sim, G. Liu, and L. Wong, Maximal quasi-bicliques with balanced noise tolerance: Concepts and co-clustering applications, In Proceedings of SDM, Atlanta, GA, USA, 2008, 72-83.
23. J. Pei, D. Jiang, and A. Zhang, On mining cross-graph quasi-cliques, In Proceedings of KDD '05, Chicago, IL, USA, 2005, 228-238.
24. C. Yang, U. Fayyad, and P. S. Bradley, Efficient discovery of error-tolerant frequent itemsets in high dimensions, In Proceedings of KDD, San Francisco, CA, USA, 2001, 194-203.
25. J. Pei, A. K. H. Tung, and J. Han, Fault-tolerant frequent pattern mining: Problems and challenges, In Proceedings of DMKD, Santa Barbara, CA, USA, 2001.
26. J. Liu, S. Paulsen, X. Sun, W. Wang, A. B. Nobel, and J. Prins, Mining approximate frequent itemsets in the presence of noise: Algorithm and analysis, In Proceedings of SDM, Bethesda, MS, USA, 2006.
27. J. Besson, C. Robardet, and J. F. Boulicaut, Mining a new fault-tolerant pattern type as an alternative to formal concept discovery, In Proceedings of ICCS '06, Reading, United Kingdom, 2006, 144-157.
28. J. Vesanto and E. Alhoniemi, Clustering of the self-organizing map, IEEE Trans Neural Networks 11(3) (2000), 586.
29. S. Wu and T. W. S. Chow, Self-organizing-map based clustering using a local clustering validity index, Neural Process. Lett. 17(3) (2003), 253-271.
30. J. Han and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2000.
31. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: an introduction to Cluster Analysis, John Wiley & Sons, 1990.
32. M. Halkidi and M. Vazirgiannis, Clustering validity assessment using multi representatives, In Proceedings of SETN, Thessaloniki, Greece, 2002.
33. P. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining, Addison-Wesley, 2005.
34. Y. Loewenstein, E. Portugaly, M. Fromer, and M. Linial, Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space. Bioinformatics 24(13) (2008), 41-49.
35. Standard and Poors http://www.standardandpoors.com [Last accessed 2006].
36. Compustat, http://www.compustat.com [Last accessed 2006].
37. Database of interacting proteins, http://dip.doe-mbi.ucla.edu [Last accessed 2006].
38. [2nd] dimacs challenge benchmarks, ftp://dimacs.rutgers. edu/pub/challenge/graph/benchmarks/clique/ [Last accessed 2006].
39. R. Gupta, G. Fang, B. Field, M. Steinbach, and V. Kumar, Quantitative evaluation of approximate frequent pattern mining algorithms, In Proceedings of KDD, Las Vegas, USA, 2008.
40. MSN Money, http://moneycentral.msn.com [Last accessed 2006].
41. T. Uno, M. Kiyomi, and H. Arimura, LCM ver.3: Collaboration of array, bitmap and prefix tree for frequent itemset mining, In Proceedings of OSDM 2005, in conjunction with KDD, Chicago, IL, USA, 2005.
42. SOM Toolbox, http://www.cis.hut.fi/projects/somtoolbox [Last accessed 2006].
43. MATLAB 7.0, http://www.mathworks.com/products/matlab [Last accessed 2006].