Search results for "quasi-clique"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
77	Zhiping Zeng, Jianyong Wang 0001, Lizhu Zhou, George Karypis	Coherent closed quasi-clique discovery from large dense graph databases.	KDD	2006	DBLP DOI BibTeX RDF	coherent subgraph, quasi-clique, graph mining
64	Mauro Brunato, Holger H. Hoos, Roberto Battiti	On Effectively Finding Maximal Quasi-cliques in Graphs.	LION	2007	DBLP DOI BibTeX RDF
64	Daxin Jiang, Jian Pei	Mining frequent cross-graph quasi-cliques.	ACM Trans. Knowl. Discov. Data	2009	DBLP DOI BibTeX RDF	joint mining, bioinformatics, Graph mining, clique
50	Xiangang Cheng, Liang-Tien Chia	Stratification-based keyframe cliques for removal of near-duplicates in video search results.	Multimedia Information Retrieval	2010	DBLP DOI BibTeX RDF	quasi-clique, stratification-based, web video, near-duplicate
48	Yuzhou Zhang, Jianyong Wang 0001, Zhiping Zeng, Lizhu Zhou	Parallel mining of closed quasi-cliques.	IPDPS	2008	DBLP DOI BibTeX RDF
47	Zhiping Zeng, Jianyong Wang 0001, Lizhu Zhou, George Karypis	Out-of-core coherent closed quasi-clique mining from large dense graph databases.	ACM Trans. Database Syst.	2007	DBLP DOI BibTeX RDF	coherent subgraph, frequent closed subgraph, quasi-clique, Graph mining, out-of-core algorithm
34	Ding Xiao, Nan Du, Bin Wu 0001, Bai Wang 0001	Community Ranking in Social Network.	IMSCCS	2007	DBLP DOI BibTeX RDF
33	Shuichi Watanabe, Junji Kitamichi, Kenichi Kuroda	A Hardware Algorithm for the Minimum p-Quasi Clique Cover Problem.	FPL	2007	DBLP DOI BibTeX RDF
33	Byung-Won On, Ergin Elmacioglu, Dongwon Lee 0001, Jaewoo Kang, Jian Pei	An effective approach to entity resolution problem using quasi-clique and its application to digital libraries.	JCDL	2006	DBLP DOI BibTeX RDF	graph partition, name disambiguation, entity resolution
27	Aritra Konar, Nicholas D. Sidiropoulos	Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining.	AAAI	2024	DBLP DOI BibTeX RDF
19	Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete	Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems.	CoRR	2024	DBLP DOI BibTeX RDF
19	Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete	Solving the Multiobjective Quasi-Clique Problem.	CoRR	2024	DBLP DOI BibTeX RDF
19	Kaiqiang Yu, Cheng Long	Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach.	CoRR	2023	DBLP DOI BibTeX RDF
19	Kaiqiang Yu, Cheng Long	Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach.	Proc. ACM Manag. Data	2023	DBLP DOI BibTeX RDF
19	Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux	The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study.	Inf. Sci.	2022	DBLP DOI BibTeX RDF
19	Guimu Guo, Da Yan 0001, Lyuheng Yuan, Jalal Khalil, Cheng Long, Zhe Jiang 0001, Yang Zhou 0001	Maximal Directed Quasi -Clique Mining.	ICDE	2022	DBLP DOI BibTeX RDF
19	Antoine Castillon, Julien Baste, Hamida Seba, Mohammed Haddad 0001	Quasi-Clique Mining for Graph Summarization.	DEXA (2)	2022	DBLP DOI BibTeX RDF
19	Bruno Q. Pinto, Celso C. Ribeiro, José A. Riveaux, Isabel Rosseti	A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy.	RAIRO Oper. Res.	2021	DBLP DOI BibTeX RDF
19	Bo Peng, Lifan Wu, Yang Wang 0098, Qinghua Wu 0002	Solving maximum quasi-clique problem by a hybrid artificial bee colony approach.	Inf. Sci.	2021	DBLP DOI BibTeX RDF
19	Scott Payne, Edgar Fuller, George Spirou, Cun-Quan Zhang	The Automatic Quasi-clique Merger algorithm (AQCM).	CoRR	2021	DBLP BibTeX RDF
19	Fabrizio Marinelli 0001, Andrea Pizzuti, Fabrizio Rossi	LP-based dual bounds for the maximum quasi-clique problem.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
19	Jiejiang Chen, Shaowei Cai 0001, Shiwei Pan, Yiyuan Wang, Qingwei Lin, Mengyu Zhao, Minghao Yin	NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem.	AAAI	2021	DBLP DOI BibTeX RDF
19	Zhuqi Miao, Balabhaskar Balasundaram	An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph.	INFORMS J. Comput.	2020	DBLP DOI BibTeX RDF
19	Qing Zhou, Una Benlic, Qinghua Wu 0002	An opposition-based memetic algorithm for the maximum quasi-clique problem.	Eur. J. Oper. Res.	2020	DBLP DOI BibTeX RDF
19	Celso C. Ribeiro, José A. Riveaux	An exact algorithm for the maximum quasi-clique problem.	Int. Trans. Oper. Res.	2019	DBLP DOI BibTeX RDF
19	Youcef Djeddi, Hacène Aït Haddadène, Nabil Belacel	An extension of adaptive multi-start tabu search for the maximum quasi-clique problem.	Comput. Ind. Eng.	2019	DBLP DOI BibTeX RDF
19	Yuyan Zheng, Chuan Shi, Xiangnan Kong, Yanfang Ye 0001	Author Set Identification via Quasi-Clique Discovery.	CIKM	2019	DBLP DOI BibTeX RDF
19	Roberto Alonso, Stephan Günnemann	Mining Contrasting Quasi-Clique Patterns.	CoRR	2018	DBLP BibTeX RDF
19	Bruno Q. Pinto, Celso C. Ribeiro, Isabel Rosseti, Alexandre Plastino 0001	A biased random-key genetic algorithm for the maximum quasi-clique problem.	Eur. J. Oper. Res.	2018	DBLP DOI BibTeX RDF
19	Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev	On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches.	Networks	2018	DBLP DOI BibTeX RDF
19	Patricia Conde Céspedes, Blaise Ngonmang, Emmanuel Viennet	An efficient method for mining the maximal α-quasi-clique-community of a given node in complex networks.	Soc. Netw. Anal. Min.	2018	DBLP DOI BibTeX RDF
19	Brijesh Kumar Sriwastava, Subhadip Basu, Ujjwal Maulik	A Quasi-Clique Mining Algorithm for Analysis of the Human Protein-Protein Interaction Network.	PReMI	2017	DBLP DOI BibTeX RDF
19	Xingqin Qi, Ruth Luo, Edgar Fuller, Rong Luo, Cun-Quan Zhang	Signed Quasi-Clique Merger: A New Clustering Method for Signed Networks with Positive and Negative Edges.	Int. J. Pattern Recognit. Artif. Intell.	2016	DBLP DOI BibTeX RDF
19	Pei Lee, Laks V. S. Lakshmanan	Query-Driven Maximum Quasi-Clique Search.	SDM	2016	DBLP DOI BibTeX RDF
19	Paras Jain 0003, Shang-Tse Chen, Mozhgan Azimpourkivi, Duen Horng Chau, Bogdan Carbunar	Spotting Suspicious Reviews via (Quasi-)clique Extraction.	CoRR	2015	DBLP BibTeX RDF
19	Srinka Basu, Debarka Sengupta, Ujjwal Maulik, Sanghamitra Bandyopadhyay	A strong Nash stability based approach to minimum quasi clique partitioning.	COMSNETS	2014	DBLP DOI BibTeX RDF
19	Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski	On the maximum quasi-clique problem.	Discret. Appl. Math.	2013	DBLP DOI BibTeX RDF
19	Srinivas Aluru	Large-scale metagenomic clustering via quasi clique enumeration and read assignment ambiguity resolution.	ICCABS	2013	DBLP DOI BibTeX RDF
19	Xiao Yang, Jaroslaw Zola, Srinivas Aluru	Parallel Metagenomic Sequence Clustering Via Sketching and Maximal Quasi-clique Enumeration on Map-Reduce Clouds.	IPDPS	2011	DBLP DOI BibTeX RDF
19	Imen Boukhris, Zied Elouedi, Thomas Fober, Marco Mernberger, Eyke Hüllermeier	Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Detection.	ISDA	2009	DBLP DOI BibTeX RDF
19	James Abello, Mauricio G. C. Resende, Sandra Sudarsky	Massive Quasi-Clique Detection.	LATIN	2002	DBLP DOI BibTeX RDF
14	Yanhui Ding, Qingzhong Li, Feifei Li	A Novel Method for Evaluating Trustworthiness between Strangers in Large, Dynamic Ad Hoc Networks.	WKDD	2009	DBLP DOI BibTeX RDF
14	Byung-Won On, Ergin Elmacioglu, Dongwon Lee 0001, Jaewoo Kang, Jian Pei	Improving Grouped-Entity Resolution Using Quasi-Cliques.	ICDM	2006	DBLP DOI BibTeX RDF