Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Recent approaches to global optimization problems through Particle Swarm Optimization
Natural Computing: an international journal
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast probabilistic algorithms for hamiltonian circuits and matchings
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering informative connection subgraphs in multi-relational graphs
ACM SIGKDD Explorations Newsletter
Discovering important nodes through graph entropy the case of Enron email database
Proceedings of the 3rd international workshop on Link discovery
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast Random Walk with Restart and Its Applications
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Learning random walks to rank nodes in graphs
Proceedings of the 24th international conference on Machine learning
Community detection in large-scale social networks
Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Proceedings of the 2008 ACM symposium on Applied computing
Graph summarization with bounded error
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Adapting Language Modeling Methods for Expert Search to Rank Wikipedia Entities
Advances in Focused Retrieval
Substructure discovery using minimum description length and background knowledge
Journal of Artificial Intelligence Research
MING: mining informative entity relationship subgraphs
Proceedings of the 18th ACM conference on Information and knowledge management
Hi-index | 0.00 |
A significant number of applications on graph require the key relations among a group of query nodes. Given a relational graph such as social network or biochemical interaction, an informative subgraph is urgent, which can best explain the relationships among a group of given query nodes. Based on Particle Swarm Optimization (PSO), a new framework of SISP (Searching the Informative Subgraph based on PSO) is proposed. SISP contains three key stages. In the initialization stage, a random spreading method is proposed, which can effectively guarantee the connectivity of the nodes in each particle; In the calculating stage of fitness, a fitness function is designed by incorporating a sign function with the goodness score; In the update stage, the intersection-based particle extension method and rule-based particle compression method are proposed. To evaluate the qualities of returned subgraphs, the appropriate calculating of goodness score is studied. Considering the importance and relevance of a node together, we present the PNR method, which makes the definition of informativeness more reliable and the returned subgraph more satisfying. At last, we present experiments on a real dataset and a synthetic dataset separately. The experimental results confirm that the proposed methods achieve increased accuracy and are efficient for any query set.