Finding All-One Hyper-Submatrix of an Incidence Matrix

Nowadays, graph theory and matrix theory are developing very rapidly. Solutions to mathematical matrix and graph problems can be applied to solve many realistic problems. Finding submatrix of a specific matrix that satisfies specific constrains is a common and hard problem. Finding all-one submatrix of incidence matrix is a meaningful problem. But for most researches, they focus on finding all-one submatrix that elements of which are adjacent ones. Problem for finding all-one submtrix composed of ones that across rows and columns are not well solved. In this paper, we tried to solve this problem. First, we defined conceptions of Hyper-Submatrix, Maximum Hyper-Submatrix and N order Hyper Submatrix of incidence matrix. Then we come up with two mathematical problems. Problem 1 is how to find Maximum Hyper-Submatrix of an incidence matrix. Problem 2 is how to find N order Hyper-Submatrix of an incidence matrix. For problem 1, we come up with method based on graph theory. An upper bound of size of all-one submatrix of the incidence matrix is obtained with the result of problem 1. For problem 2, we come up with Algorithm 2 to solve it. Time complexity and space complexity are analyzed. Optimized algorithm are proposed and time complexity is optimized to O(m[n(n+1)]/2). Comparison experiments illustrate performance of 2 algorithm we proposed is much better than Apriori algorithm, and a little worse than optimized PrefixSpan algorithm.

[1]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[2]  Inderjit S. Dhillon,et al.  Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.

[3]  Michael J. Franklin,et al.  Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing , 2012, NSDI.

[4]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[5]  Haklin Kim.  Finding a Maximum Independent Set in a Permutation Graph , 1990, Inf. Process. Lett..

[6]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[7]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[8]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[9]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[10]  Qiming Chen,et al.  PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.

[11]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[12]  Yuan Zhang,et al.  The Stein-Lovász Theorem and Its Applications to Some Combinatorial arrays , 2008 .

[13]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[14]  Norman Zadeh,et al.  Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows , 1972, JACM.

[15]  R. Jonker,et al.  Improving the Hungarian assignment algorithm , 1986 .

[16]  Hee Yong Youn,et al.  A Novel Semantic Web Service Discovery Scheme Using Bipartite Graph , 2013, 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing.

[17]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[18]  Wenyuan Li,et al.  Analytical model and algorithm for tracing active power flow based on extended incidence matrix , 2009 .

[19]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[20]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[21]  J. Jeffry Howbert,et al.  The Maximum Clique Problem , 2007 .

[22]  Charu C. Aggarwal,et al.  A Tree Projection Algorithm for Generation of Frequent Item Sets , 2001, J. Parallel Distributed Comput..

[23]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[24]  Byungun Yoon,et al.  A text-mining-based patent network: Analytical tool for high-technology trend , 2004 .

[25]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.