Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Foundations of statistical natural language processing
Foundations of statistical natural language processing
Generalized maximum flow algorithms
Generalized maximum flow algorithms
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
SemRank: ranking complex relationship search results on the semantic web
WWW '05 Proceedings of the 14th international conference on World Wide Web
Improving web search results using affinity graph
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Less is more: probabilistic models for retrieving fewer relevant documents
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Measuring and extracting proximity in networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Novelty and diversity in information retrieval evaluation
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
StatSnowball: a statistical approach to extracting entity relationships
Proceedings of the 18th international conference on World wide web
NAGA: Searching and Ranking Knowledge
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Context-Aware Object Connection Discovery in Large Graphs
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
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
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
| Hi-index | 0.00 |
Mining and explaining relationships between objects are challenging tasks in the field of knowledge search. We propose a new approach for the tasks using disjoint paths formed by links in Wikipedia. To realizing this approach, we propose a naive and a generalized flow based method, and a technique of avoiding flow confluences for forcing a generalized flow to be disjoint as possible. We also apply the approach to classification of relationships. Our experiments reveal that the generalized flow based method can mine many disjoint paths important for a relationship, and the classification is effective for explaining relationships.