Effective pruning techniques for mining quasi-cliques

Effective pruning techniques for mining quasi-cliques

10.1007/978-3-540-87481-2_3

Saved in:

書目詳細資料
Main Authors:	Liu, G., Wong, L.
其他作者:	COMPUTER SCIENCE
格式:	Conference or Workshop Item
出版:	2013
在線閱讀:	http://scholarbank.nus.edu.sg/handle/10635/40630
標簽:	添加標簽沒有標簽, 成為第一個標記此記錄!
機構:	National University of Singapore

相似書籍

Reproducibility report for ACM SIGMOD 2024 paper: 'Fast maximal quasi-clique enumeration: a pruning and branching co-design approach'
由: Meling, Hein, et al.
出版: (2025)

Detecting hubs and quasi cliques in scale-free networks
由: Srihari, S., et al.
出版: (2013)

Mining sub-trajectory cliques to find frequent routes
由: Aung, H.H., et al.
出版: (2014)

Clique coverings and clique partitions of the K-power of graphs
由: Tanawat Wichianpaisarn
出版: (2014)

Clique coverings and clique partitions of the K-power of graphs
由: Tanawat Wichianpaisarn
出版: (2007)

Clique algorithm
由: Tan, Majorvin N., et al.
出版: (2008)

Clique algorithm
由: Tan, Marjovin N., et al.
出版: (2008)

Minimum 2-clique and 3-clique partitions of simple connected graphs
由: Alto, Washington Lee
出版: (1992)

Clique-Colorings of Graphs
由: Tanawat Wichianpaisarn
出版: (2013)

Clique partitions of glued graphs
由: Uthoomporn Jongthawonwuth
出版: (2012)

Clique partitions of glued graphs
由: Uthoomporn Jongthawonwuth
出版: (2009)

Clique coverings of glued graphs
由: Wannapol Pimpasalee
出版: (2008)

Investigating large language model pruning techniques
由: Cheng, Yixiao
出版: (2025)

Edge-regular graphs with regular cliques
由: Greaves, Gary Royden Watson, et al.
出版: (2019)

Cyclic clique decompositions of powerof cycles
由: Apiwat Peereeyaphat
出版: (2018)

Natural document clustering by clique percolation in random graphs
由: GAO, Wei, et al.
出版: (2006)

gPrune: A Constraint Pushing Framework for Graph Pattern Mining
由: ZHU, Feida, et al.
出版: (2007)

On the clique number of a strongly regular graph
由: Greaves, Gary Royden Watson, et al.
出版: (2021)

Some results on clique partitions of regular graphs
由: Escaner, Jona Kristine E., et al.
出版: (1999)

A problem on clique partitions of regular graphs
由: Campena, Francis Joseph H., et al.
出版: (2018)

Clique percolation for finding naturally cohesive and overlapping document clusters
由: GAO, Wei, et al.
出版: (2006)

Fast algorithms for maximal clique enumeration with limited memory
由: Cheng, James, et al.
出版: (2013)

Another construction of edge-regular graphs with regular cliques
由: Greaves, Gary Royden Watson, et al.
出版: (2020)

Secure server-aided data sharing clique with attestation
由: WANG, Yujue, et al.
出版: (2020)

A common generalization of line graphs and clique graphs
由: Bernardo, Servando D., Jr.
出版: (2004)

Consumerist Lifestyle of Teenagers Portrayed In Lisi Harrison' The Clique
由: SHINTA AMAHARANI
出版: (2011)

Incremental maintenance of maximal cliques in a dynamic graph
由: Das, Apurba, et al.
出版: (2019)

Voter model on networks partitioned into two cliques of arbitrary sizes
由: Gastner, Michael T, et al.
出版: (2020)

Pruning Divide & Conquer networks
由: Romaniuk, S.G.
出版: (2016)

Efficient temporal graph processing : shortest paths, closeness centralities and S-cliques
由: Ni, Peng
出版: (2021)

Effective neural network pruning using cross-validation
由: Huynh, T.Q., et al.
出版: (2013)

Accelerating queries by pruning XML documents
由: Bressan, S., et al.
出版: (2013)

On NP-hardness of the clique partition : independence number gap recognition and related problems
由: Busygin, Stanislav., et al.
出版: (2012)

Pruned neural networks for regression
由: Setiono, R., et al.
出版: (2013)

Pruning in face forgery detection
由: Lam, Zhi Fah
出版: (2023)

Pruning methods for RBF networks
由: Tarannum Shakir.
出版: (2008)

Axon and dendrite pruning in Drosophila
由: Yu, F., et al.
出版: (2014)

Properties of forward pruning in game-tree search
由: Yew, J.L., et al.
出版: (2013)

Mean Consensus Time of the Voter Model on Networks Partitioned into Two Cliques of Arbitrary Sizes
由: M. T. Gastner, et al.
出版: (2021)

Neural network pruning for function approximation
由: Setiono, Rudy, et al.
出版: (2013)