Fast Detection of Dense Subgraphs with Iterative Shrinking and Expansion
暂无分享,去创建一个
[1] Amnon Shashua,et al. Probabilistic graph and hypergraph matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[2] Koby Crammer,et al. A rate-distortion one-class model and its applications to clustering , 2008, ICML '08.
[3] Yousef Saad,et al. Dense Subgraph Extraction with Application to Community Detection , 2012, IEEE Transactions on Knowledge and Data Engineering.
[4] Dale Schuurmans,et al. Graphical Models and Point Pattern Matching , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .
[6] Chong-Wah Ngo,et al. Near-duplicate keyframe retrieval with visual keywords and semantic context , 2007, CIVR '07.
[7] Delbert Dueck,et al. Clustering by Passing Messages Between Data Points , 2007, Science.
[8] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[9] Andrea Torsello,et al. Matching as a non-cooperative game , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[10] Jörgen W. Weibull,et al. Evolutionary Game Theory , 1996 .
[11] T. Motzkin,et al. Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.
[12] Minsu Cho,et al. Reweighted Random Walks for Graph Matching , 2010, ECCV.
[13] Immanuel M. Bomze,et al. Branch-and-bound approaches to standard quadratic optimization problems , 2002, J. Glob. Optim..
[14] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[15] Marcello Pelillo,et al. Dominant Sets and Pairwise Clustering , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Shuicheng Yan,et al. Robust Clustering as Ensembles of Affinity Relations , 2010, NIPS.
[17] Martial Hebert,et al. An Integer Projected Fixed Point Method for Graph Matching and MAP Inference , 2009, NIPS.
[18] William W. Cohen,et al. Power Iteration Clustering , 2010, ICML.
[19] Ze-Nian Li,et al. Matching by Linear Programming and Successive Convexification , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[20] Matthias Hein,et al. An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA , 2010, NIPS.
[21] Srinivasan Parthasarathy,et al. New Algorithms for Fast Discovery of Association Rules , 1997, KDD.
[22] Shuicheng Yan,et al. Near-duplicate keyframe retrieval by nonrigid image matching , 2008, ACM Multimedia.
[23] Peter Meer,et al. Point matching under large image deformations and illumination changes , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] D.M. Mount,et al. An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[25] Dorin Comaniciu,et al. Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[26] Carlo Sansone,et al. A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs , 2003, GbRPR.
[27] M. Newman,et al. Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[28] Hung-Khoon Tan,et al. Near-Duplicate Keyframe Identification With Interest Point Matching and Pattern Learning , 2007, IEEE Transactions on Multimedia.
[29] Martial Hebert,et al. A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[30] Edwin R. Hancock,et al. Graph Matching With a Dual-Step EM Algorithm , 1998, IEEE Trans. Pattern Anal. Mach. Intell..
[31] Marcello Pelillo,et al. Matching Free Trees with Replicator Equations , 2001, NIPS.
[32] P D Kaplan,et al. DNA solution of the maximal clique problem. , 1997, Science.
[33] M. Zaslavskiy,et al. A Path Following Algorithm for the Graph Matching Problem , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[34] Radu Horaud,et al. Stereo Correspondence Through Feature Grouping and Maximal Cliques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[35] Haibin Ling,et al. Shape Classification Using the Inner-Distance , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[36] M E J Newman,et al. Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[37] Jean Ponce,et al. A Tensor-Based Algorithm for High-Order Graph Matching , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[38] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[39] G LoweDavid,et al. Distinctive Image Features from Scale-Invariant Keypoints , 2004 .
[40] Marcello Pelillo,et al. A Game-Theoretic Approach to Hypergraph Clustering , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[41] T. Vicsek,et al. Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.
[42] João Paulo Costeira,et al. A Global Solution to Sparse Correspondence Problems , 2003, IEEE Trans. Pattern Anal. Mach. Intell..