Introduction to algorithms
Drawing graphs to convey proximity: an incremental arrangement method
ACM Transactions on Computer-Human Interaction (TOCHI)
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Relational clustering for multi-type entity resolution
MRDM '05 Proceedings of the 4th international workshop on Multi-relational mining
Centrality measures based on current flow
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
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)
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
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)
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Data & Knowledge Engineering
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
Audience selection for on-line brand advertising: privacy-friendly social network targeting
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Applying Electromagnetic Field Theory Concepts to Clustering with Constraints
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Scalable proximity estimation and link prediction in online social networks
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Efficient processing of group-oriented connection queries in a large graph
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
Proceedings of the 3rd Workshop on Social Network Mining and Analysis
Fast computation of SimRank for static and dynamic information networks
Proceedings of the 13th International Conference on Extending Database Technology
K-isomorphism: privacy preserving network publication against structural attacks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Journal of the American Society for Information Science and Technology
Parallel SimRank computation on large graphs with iterative aggregation
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining and explaining relationships in wikipedia
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
TAGs: scalable threshold-based algorithms for proximity computation in graphs
Proceedings of the 14th International Conference on Extending Database Technology
Estimating sizes of social networks via biased sampling
Proceedings of the 20th international conference on World wide web
Enishi: searching knowledge about relations by complementarily utilizing wikipedia and the web
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
Diversified ranking on large graphs: an optimization viewpoint
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Unifying guilt-by-association approaches: theorems and fast algorithms
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Fast graph query processing with a low-cost index
The VLDB Journal — The International Journal on Very Large Data Bases
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
Querying large graph databases
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
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
Towards expressive exploratory search over entity-relationship data
Proceedings of the 21st international conference companion on World Wide Web
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
Biomine: a network-structured resource of biological entities for link prediction
Bisociative Knowledge Discovery
Coevolution of network structure and content
Proceedings of the 3rd Annual ACM Web Science Conference
Subgraph Extraction for Trust Inference in Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Accurate and scalable nearest neighbors in large networks based on effective importance
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Penguins in sweaters, or serendipitous entity search on user-generated content
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Guide query in social networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity between nodes in networks. We propose a new way of measuring and extracting proximity in networks called "cycle free effective conductance"(CFEC). Our proximity measure can handle more than two endpoints, directed edges, is statistically well-behaved, and produces an effectiveness score for the computed subgraphs. We provide an efficien talgorithm. Also, we report experimental results and show examples for three large network data sets: a telecommunications calling graph, the IMDB actors graph, and an academic co-authorship network.