Finding Maximal Quasi-cliques Containing a Target Vertex in a Graph

Yuan Heng Chou, En Tzu Wang, Arbee L. P. Chen

Abstract

Many real-world phenomena such as social networks and biological networks can be modeled as graphs. Discovering dense sub-graphs from these graphs may be able to find interesting facts about the phenomena. Quasi-cliques are a type of dense graphs, which is close to the complete graphs. In this paper, we want to find all maximal quasi-cliques containing a target vertex in the graph for some applications. A quasi-clique is defined as a maximal quasi-clique if it is not contained by any other quasi-cliques. We propose an algorithm to solve this problem and use several pruning techniques to improve the performance. Moreover, we propose another algorithm to solve a special case of this problem, i.e. finding the maximal cliques. The experiment results reveal that our method outperforms the previous work both in real and synthetic datasets in most cases.

References

  1. Agarwal, N., Liu, H., Tang, L., Yu, P. S., 2008. Identifying the Influential Bloggers in a Community. In International Conference on Web Search and Data Mining.
  2. Abello, J., Resende, M. G. C., Sudarsky, S., 2002. Massive quasi-clique detection. In 5th, Latin American Symposium on Theoretical Informatics.
  3. Brunato, M., Hoos, H. H., Battiti, R., 2007. On Effectively Finding Maximal Quasi-Cliques in Graphs. Learning and Intelligent Optimization. Springer-Verlag Berlin, Heidelberg.
  4. Du, N., Wu, B., Xu, L., Wang, B., Pei, X., 2006. A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network. In 6th, IEEE International Conference on Data Mining Workshops.
  5. Fratkin, E., Naughton, B. T., Brutlag, D. L., Batzoglou, S., 2006. MotifCut: regulatory motifs finding with maximum density sub-graphs. In ISMB (Supplement of Bioinformatics).
  6. Goyal, A., Bonchi, F., Lakshmanan, L. V. S., 2008. Discovering Leaders from Community Actions. In ACM 17th Conference on Information and Knowledge Management.
  7. Gibson, D., Kumar, R., Tomkins, A., 2005. Discovering large dense subgraphs in massive graphs. In 31st, International Conference on Very large data bases.
  8. Langston, M. A., Lin, L., Peng, X., 2005. A combinatorial approach to the analysis of differential gene expression data: The use of graph algorithms for disease prediction and screening. Methods of Microarray Data Analysis, Springer, US, 4th edition.
  9. Liu, G., Wong, L., 2008. Effective Pruning Techniques for Mining Quasi-cliques. In European conference on Machine Learning and Knowledge Discovery in Databases.
  10. Sozio, M., Gionis, A., 2010. The community-search problem and how to plan a successful cocktail party. In 16th, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
  11. Tsourakakis, C. E., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M. A., 2013. Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees. In 19th, ACM SIGKDD international conference on Knowledge discovery and data mining.
  12. Xiang, J., Guo, C., Aboulnaga, A., 2013. Scalable Maximum Clique Computation Using MapReduce. In 29th, IEEE International Conference on Data Engineering.
  13. Zou, L., Chen, L., Lu, Y., 2007. Top-K Subgraph Matching Query in a Large Graph. In ACM first Ph.D. workshop in CIKM.
  14. Zou, Z., Li, J., Gao, H., Zhang, S., 2010. Finding Top-k Maximal Cliques in an Uncertain Graph. In 26th, IEEE International Conference on Data Engineering.
Download


Paper Citation


in Harvard Style

Chou Y., Wang E. and Chen A. (2015). Finding Maximal Quasi-cliques Containing a Target Vertex in a Graph . In Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA, ISBN 978-989-758-103-8, pages 5-15. DOI: 10.5220/0005498400050015


in Bibtex Style

@conference{data15,
author={Yuan Heng Chou and En Tzu Wang and Arbee L. P. Chen},
title={Finding Maximal Quasi-cliques Containing a Target Vertex in a Graph},
booktitle={Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA,},
year={2015},
pages={5-15},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005498400050015},
isbn={978-989-758-103-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA,
TI - Finding Maximal Quasi-cliques Containing a Target Vertex in a Graph
SN - 978-989-758-103-8
AU - Chou Y.
AU - Wang E.
AU - Chen A.
PY - 2015
SP - 5
EP - 15
DO - 10.5220/0005498400050015