메뉴 건너뛰기




Volumn 72, Issue , 2012, Pages 285-303

SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices

Author keywords

Clustering; Graph partitioning; Mining methods and algorithms; Vertex cut

Indexed keywords

CLUSTERING; CONCEPT MAPS; DATA PARTITION; DIRECTED GRAPHS; GRAPH PARTITIONING; GRAPH SIMPLIFICATION; GRAPH-BASED; HIERARCHICAL PARTITIONING; MINING METHODS AND ALGORITHMS; RECURSIVE APPLICATIONS; SOCIAL CONNECTION; STRUCTURAL BALANCE; VERTEX DISJOINT; VERTEX-CUT;

EID: 84855238538     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2011.11.004     Document Type: Article
Times cited : (66)

References (49)
  • 1
    • 84855226806 scopus 로고    scopus 로고
    • http://strandmaps.nsdl.org/
  • 2
    • 84855245462 scopus 로고    scopus 로고
    • http://glaros.dtc.umn.edu/gkhome/views/metis
  • 3
    • 84855220063 scopus 로고    scopus 로고
    • http://www.sandia.gov/bahendr/chaco.html
  • 4
    • 84855245464 scopus 로고    scopus 로고
    • http://www.ace.ual.es/cgil/grafos/Graph-Partitioning.html
  • 5
    • 84855245463 scopus 로고    scopus 로고
    • http://www.gnu.org/software/glpk/
  • 7
    • 84855245466 scopus 로고    scopus 로고
    • Multilevel heuristic algorithm for graph partitioning
    • LNCS Essex (UK) Published by
    • R. Baños, C. Gil, J. Ortega, and F. Montoya Multilevel heuristic algorithm for graph partitioning 3rd EvoCOP 2003 LNCS Essex (UK) Published by
    • (2003) 3rd EvoCOP
    • Baños, R.1    Gil, C.2    Ortega, J.3    Montoya, F.4
  • 9
    • 84855238578 scopus 로고    scopus 로고
    • An exact algorithm for solving the vertex separator problem
    • M. Biha, and M. Meurs An exact algorithm for solving the vertex separator problem Journal of Global Optimization 2010 1 10
    • (2010) Journal of Global Optimization , pp. 1-10
    • Biha, M.1    Meurs, M.2
  • 11
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual Web search engine
    • S. Brin, and L. Page The anatomy of a large-scale hypertextual Web search engine Computer Networks and ISDN Systems 30 1-7 1998 107 117
    • (1998) Computer Networks and ISDN Systems , vol.30 , Issue.17 , pp. 107-117
    • Brin, S.1    Page, L.2
  • 12
    • 0001460554 scopus 로고    scopus 로고
    • Genetic algorithm and graph partitioning
    • T. Bui, and B. Moon Genetic algorithm and graph partitioning IEEE Transactions on Computers 45 1996 841 855 (Pubitemid 126784444)
    • (1996) IEEE Transactions on Computers , vol.45 , Issue.7 , pp. 841-855
    • Bui, T.N.1    Moon, B.R.2
  • 13
    • 0036835935 scopus 로고    scopus 로고
    • Reasoning for web document associations and its applications in site map construction
    • K. Candan, and W. Li Reasoning for web document associations and its applications in site map construction Data & Knowledge Engineering 43 2 2002
    • (2002) Data & Knowledge Engineering , vol.43 , Issue.2
    • Candan, K.1    Li, W.2
  • 14
    • 77957752478 scopus 로고    scopus 로고
    • Editorial: An integration of WordNet and fuzzy association rule mining for multi-label document clustering
    • C.-L. Chen, F.S.C. Tseng, and T. Liang Editorial: An integration of WordNet and fuzzy association rule mining for multi-label document clustering Data & Knowledge Engineering 69 11 2010
    • (2010) Data & Knowledge Engineering , vol.69 , Issue.11
    • Chen, C.-L.1    Tseng, F.S.C.2    Liang, T.3
  • 16
    • 0032307688 scopus 로고    scopus 로고
    • Multiway partitioning with pairwise movement
    • J. Cong, and S.K. Lim Multiway partitioning with pairwise movement ICCAD 1998 512 516
    • (1998) ICCAD , pp. 512-516
    • Cong, J.1    Lim, S.K.2
  • 17
    • 27244441304 scopus 로고    scopus 로고
    • Community detection in complex networks using extremal optimization
    • J. Duch, and A. Arenas Community detection in complex networks using extremal optimization Physical Review E 72 2005 027104
    • (2005) Physical Review e , vol.72 , pp. 027104
    • Duch, J.1    Arenas, A.2
  • 19
    • 85046457769 scopus 로고
    • A linear time heuristic for improving network partitions
    • C. Fiduccia, and R. Mattheyses A linear time heuristic for improving network partitions Proc. 19th IEEE DAC 1982 175 181
    • (1982) Proc. 19th IEEE DAC , pp. 175-181
    • Fiduccia, C.1    Mattheyses, R.2
  • 21
    • 0034592749 scopus 로고    scopus 로고
    • Efficient identification of web communities
    • G. Flake, S. Lawrence, and C. Giles Efficient identification of web communities KDD 2000 150 160
    • (2000) KDD , pp. 150-160
    • Flake, G.1    Lawrence, S.2    Giles, C.3
  • 27
    • 79955521337 scopus 로고    scopus 로고
    • Prediction or not? An energy-efficient framework for clustering-based data collection in wireless sensor networks
    • H. Jiang, S. Jin, and C. Wang Prediction or not? An energy-efficient framework for clustering-based data collection in wireless sensor networks IEEE Transactions on Parallel and Distributed Systems 22 6 2011 1064 1071
    • (2011) IEEE Transactions on Parallel and Distributed Systems , vol.22 , Issue.6 , pp. 1064-1071
    • Jiang, H.1    Jin, S.2    Wang, C.3
  • 28
    • 79951676428 scopus 로고    scopus 로고
    • Document clustering using synthetic cluster prototypes
    • A. Kalogeratos, and A. Likas Document clustering using synthetic cluster prototypes Data & Knowledge Engineering 70 3 2011
    • (2011) Data & Knowledge Engineering , vol.70 , Issue.3
    • Kalogeratos, A.1    Likas, A.2
  • 30
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • PII S1064827595287997
    • G. Karypis, and V. Kumar A fast and high quality multilevel scheme for partitioning irregular graphs SIAM Journal on Scientific Computing 20 1998 359 392 (Pubitemid 128689516)
    • (1998) SIAM Journal of Scientific Computing , vol.20 , Issue.1 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 31
    • 0002806618 scopus 로고    scopus 로고
    • Multilevelk-way Partitioning Scheme for Irregular Graphs
    • DOI 10.1006/jpdc.1997.1404, PII S0743731597914040
    • G. Karypis, and V. Kumar Multilevel k-way partitioning scheme for irregular graphs Journal of Parallel and Distributed Computing 48 1 1998 96 129 (Pubitemid 128347296)
    • (1998) Journal of Parallel and Distributed Computing , vol.48 , Issue.1 , pp. 96-129
    • Karypis, G.1    Kumar, V.2
  • 32
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphics
    • B. Kernighan, and S. Lin An efficient heuristic procedure for partitioning graphics The Bell System Technical Journal 1970 291 307
    • (1970) The Bell System Technical Journal , pp. 291-307
    • Kernighan, B.1    Lin, S.2
  • 33
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C. Gelatt Jr., and M. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, Jr.C.2    Vecchi, M.3
  • 34
    • 0032256758 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • J. Kleinberg Authoritative sources in a hyperlinked environment Proc. of SODA 1998 668 677
    • (1998) Proc. of SODA , pp. 668-677
    • Kleinberg, J.1
  • 36
    • 52949106331 scopus 로고    scopus 로고
    • Statistical properties of community structure in large social and information networks
    • J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney Statistical properties of community structure in large social and information networks Proc. of WWW 2008
    • (2008) Proc. of WWW
    • Leskovec, J.1    Lang, K.2    Dasgupta, A.3    Mahoney, M.4
  • 38
    • 79960115446 scopus 로고    scopus 로고
    • Ranks and representations for spectral graph bisection
    • J.G. Martin, and E.R. Canfield Ranks and representations for spectral graph bisection SIAM Journal on Scientific Computing 31 5 2009 3529 3546
    • (2009) SIAM Journal on Scientific Computing , vol.31 , Issue.5 , pp. 3529-3546
    • Martin, J.G.1    Canfield, E.R.2
  • 39
  • 40
    • 33749468596 scopus 로고    scopus 로고
    • Finding community structure in networks using the eigenvectors of matrices
    • M. Newman Finding community structure in networks using the eigenvectors of matrices Physical Review E 74 2006 036104
    • (2006) Physical Review e , vol.74 , pp. 036104
    • Newman, M.1
  • 41
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • M. Newman, and M. Girvan Finding and evaluating community structure in networks Physical Review E 69 2004 026113
    • (2004) Physical Review e , vol.69 , pp. 026113
    • Newman, M.1    Girvan, M.2
  • 47
    • 80052285367 scopus 로고    scopus 로고
    • A unique property of single-link distance and its application in data clustering
    • Y. Song, S. Jin, and J. Shen A unique property of single-link distance and its application in data clustering Data & Knowledge Engineering 70 11 2011 984 1003
    • (2011) Data & Knowledge Engineering , vol.70 , Issue.11 , pp. 984-1003
    • Song, Y.1    Jin, S.2    Shen, J.3
  • 48
    • 0034456293 scopus 로고    scopus 로고
    • Mesh partitioning: A multilevel balancing and refinement algorithm
    • DOI 10.1137/S1064827598337373, PII S1064827598337373
    • C. Walshaw, and M. Cross Mesh partitioning. A multilevel balancing and refinement algorithm SIAM Journal on Scientific Computing 22 1 2000 63 80 (Pubitemid 32270871)
    • (2000) SIAM Journal of Scientific Computing , vol.22 , Issue.1 , pp. 63-80
    • Walshaw, C.1    Cross, M.2
  • 49
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of 'small-world' networks
    • DOI 10.1038/30918
    • D. Watts, and S. Strogatz Collective dynamics of 'small-world' networks Nature 393 1998 440 442 (Pubitemid 28292183)
    • (1998) Nature , vol.393 , Issue.6684 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.