Inferring Web communities from link topology
Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 11th international conference on World Wide Web
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Automatic multimedia cross-modal correlation discovery
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Manifold-ranking based image retrieval
Proceedings of the 12th annual ACM international conference on Multimedia
Mining compressed frequent-pattern sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Discovering informative connection subgraphs in multi-relational graphs
ACM SIGKDD Explorations Newsletter
BANKS: browsing and keyword searching in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast direction-aware proximity for graph mining
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Measuring and extracting proximity graphs in networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Authority-based keyword search in databases
ACM Transactions on Database Systems (TODS)
Hierarchical, Parameter-Free Community Discovery
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
C-DEM: a multi-modal query system for Drosophila Embryo databases
Proceedings of the VLDB Endowment
Fast mining of complex time-stamped events
Proceedings of the 17th ACM conference on Information and knowledge management
Efficient query processing on graph databases
ACM Transactions on Database Systems (TODS)
A viewpoint-based approach for interaction graph analysis
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
TANGENT: a novel, 'Surprise me', recommendation algorithm
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient processing of group-oriented connection queries in a large graph
Proceedings of the 18th ACM conference on Information and knowledge management
MING: mining informative entity relationship subgraphs
Proceedings of the 18th ACM conference on Information and knowledge management
iPoG: fast interactive proximity querying on graphs
Proceedings of the 18th ACM conference on Information and knowledge management
Community mining on dynamic weighted directed graphs
Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management
Graph clustering based on structural/attribute similarities
Proceedings of the VLDB Endowment
K-isomorphism: privacy preserving network publication against structural attacks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
The community-search problem and how to plan a successful cocktail party
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Crowdsourcing and service delivery
IBM Journal of Research and Development
An agglomerative query model for discovery in linked data: semantics and approach
Procceedings of the 13th International Workshop on the Web and Databases
Editorial: BioDB: An ontology-enhanced information system for heterogeneous biological information
Data & Knowledge Engineering
Mining and explaining relationships in wikipedia
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Clustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities
ACM Transactions on Knowledge Discovery from Data (TKDD)
Supervised random walks: predicting and recommending links in social networks
Proceedings of the fourth ACM international conference on Web search and data mining
TAGs: scalable threshold-based algorithms for proximity computation in graphs
Proceedings of the 14th International Conference on Extending Database Technology
Recommendations for the long tail by term-query graph
Proceedings of the 20th international conference companion on World wide web
Finding influential mediators in social networks
Proceedings of the 20th international conference companion on World wide web
Structure and attribute index for approximate graph matching in large graphs
Information Systems
Disease gene prioritization based on topological similarity in protein-protein interaction networks
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
R2DF framework for ranked path queries over weighted RDF graphs
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
Diversity in ranking via resistive graph centers
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast graph query processing with a low-cost index
The VLDB Journal — The International Journal on Very Large Data Bases
Finding appropriate experts for collaboration
WAIM'11 Proceedings of the 12th international conference on Web-age information management
"Tell me more": finding related items from user provided feedback
DS'11 Proceedings of the 14th international conference on Discovery science
SISP: a new framework for searching the informative subgraph based on PSO
Proceedings of the 20th ACM international conference on Information and knowledge management
Finding information nebula over large networks
Proceedings of the 20th ACM international conference on Information and knowledge management
REX: explaining relationships between entity pairs
Proceedings of the VLDB Endowment
Analysis of implicit relations on wikipedia: measuring strength through mining elucidatory objects
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Dynamic skyline queries in large graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Querying large graph databases
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Role of centrality in network-based prioritization of disease genes
EvoBIO'10 Proceedings of the 8th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Fast and exact top-k search for random walk with restart
Proceedings of the VLDB Endowment
Fast discovery of reliable k-terminal subgraphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
BASSET: scalable gateway finder in large graphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
How random walks can help tourism
ECIR'12 Proceedings of the 34th European conference on Advances in Information Retrieval
Gateway finder in large graphs: problem definitions and fast solutions
Information Retrieval
TourViz: interactive visualization of connection pathways in large graphs
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient query recommendations in the long tail via center-piece subgraphs
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Review of bisonet abstraction techniques
Bisociative Knowledge Discovery
Finding representative nodes in probabilistic graphs
Bisociative Knowledge Discovery
Maximum consistency preferential random walks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
A modified random walk framework for handling negative ratings and generating explanations
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on twitter and microblogging services, social recommender systems, and CAMRa2010: Movie recommendation in context
Discovering social media experts by integrating social networks and contents
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Proceedings of the 22nd international conference on World Wide Web
Penguins in sweaters, or serendipitous entity search on user-generated content
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
Given Q nodes in a social network (say, authorship network), how can we find the node/author that is the center-piece, and has direct or indirect connections to all, or most of them? For example, this node could be the common advisor, or someone who started the research area that the Q nodes belong to. Isomorphic scenarios appear in law enforcement (find the master-mind criminal, connected to all current suspects), gene regulatory networks (find the protein that participates in pathways with all or most of the given Q proteins), viral marketing and many more.Connection subgraphs is an important first step, handling the case of Q=2 query nodes. Then, the connection subgraph algorithm finds the b intermediate nodes, that provide a good connection between the two original query nodes.Here we generalize the challenge in multiple dimensions: First, we allow more than two query nodes. Second, we allow a whole family of queries, ranging from 'OR' to 'AND', with 'softAND' in-between. Finally, we design and compare a fast approximation, and study the quality/speed trade-off.We also present experiments on the DBLP dataset. The experiments confirm that our proposed method naturally deals with multi-source queries and that the resulting subgraphs agree with our intuition. Wall-clock timing results on the DBLP dataset show that our proposed approximation achieve good accuracy for about 6:1 speedup.