Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
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
SimFusion: measuring similarity using unified relationship matrix
Proceedings of the 28th 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
Node similarity in the citation graph
Knowledge and Information Systems
Yago: a core of semantic knowledge
Proceedings of the 16th international conference on World Wide Web
The Google Similarity Distance
IEEE Transactions on Knowledge and Data Engineering
Web-Based Measure of Semantic Relatedness
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Association thesaurus construction methods based on link co-occurrence analysis for wikipedia
Proceedings of the 17th ACM conference on Information and knowledge management
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
Wikipedia mining for an association web thesaurus construction
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Mining and explaining relationships in wikipedia
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
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
Evaluating credibility of web information
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
| Hi-index | 0.00 |
We focus on measuring relations between pairs of objects in Wikipedia whose pages can be regarded as individual objects. Two kinds of relations between two objects exist: in Wikipedia, an explicit relation is represented by a single link between the two pages for the objects, and an implicit relation is represented by a link structure containing the two pages. Previously proposed methods are inadequate for measuring implicit relations because they use only one or two of the following three important factors: distance, connectivity, and co-citation. We propose a new method reflecting all the three factors by using a generalized maximum flow. We confirm that our method can measure the strength of a relation more appropriately than these previously proposed methods do. Another remarkable aspect of our method is mining elucidatory objects, that is, objects constituting a relation. We explain that mining elucidatory objects opens a novel way to deeply understand a relation.