Partitioning a graph by iteratively excluding edges
作者： Boriana Lubomirova Milenova , Marcos M Campos
DOI:
关键词:
摘要: Methods, machines, and stored instructions are provided for partitioning a graph of nodes into clusters by iteratively excluding edges in the graph. For each node at least subset graph, module determines whether to exclude and, if so, selects exclusion edge(s) node's neighbor(s). The neighbor(s) based part on degree overlap between any subset(s) that yet not sufficiently partitioned clusters, repeats step determining selecting exclusion, or partitioned. Subset(s) already may be skipped during repeated steps.
lens.org 参考文章(21)
Natalia Flora de Lima, Teresa Bernarda Ludermir, Frankenstein PSO applied to neural network weights and architectures 2011 IEEE Congress of Evolutionary Computation (CEC). pp. 2452- 2456 ,(2011) , 10.1109/CEC.2011.5949921
Kenneth A. Lloyd, Object oriented system and method of graphically displaying and analyzing complex systems ,(2007)
Nan Gong, Jari Koister, Methods and systems for processing large graphs using density-based processes using map-reduce ,(2012)
Ankur Narang, Jyothish Soman, Distributed Scalable Clustering and Community Detection ,(2012)
Laura E. Boucheron, Object and spatial level quantitative image analysis ,(2008)
Emden R. Gansner, Yifan Hu, Methods, Systems, and Products for Graphing Data ,(2008)
Tie-Yan Liu, Taifeng Wang, Efficient query clustering using multi-partite graphs ,(2011)
Hakon Gudbjartsson, Agust Egilsson, Indexing, rewriting and efficient querying of relations referencing spatial objects ,(2003)
Bulent Yener, Cigdem Gunduz, S. Gultekin, Method and apparatus for tissue modeling ,(2005)
Zoltan I. Gyongyi, Social affinity on the web ,(2010)