The Community for Technology Leaders
2013 IEEE Seventh International Conference on Semantic Computing (2013)
Irvine, CA, USA USA
Sept. 16, 2013 to Sept. 18, 2013
pp: 78-85
ABSTRACT
We describe an approach for performing entity type recognition in heterogeneous semantic graphs in order to reduce the computational cost of performing coreferenceresolution. Our research specifically addresses the problem of working with semi-structured text that uses ontologies that are not informative or not known. This problem is similar to co reference resolution in unstructured text, where entities and their types are identified using contextual information and linguistic-based analysis. Semantic graphs are semi-structured with very little contextual information and trivial grammars that do not convey additional information. In the absence of known ontologies, performing co reference resolution can be challenging. Our work uses a supervised machine learning algorithm and entity type dictionaries to map attributes to a common attribute space. We evaluated the approach in experiments using data from Wikipedia, Freebase and Arnetminer.
INDEX TERMS
Entity type recognition, Heterogeneous data, Attribute mapping, Coreference resolution, Instance matching
CITATION

J. Sleeman and T. Finin, "Type Prediction for Efficient Coreference Resolution in Heterogeneous Semantic Graphs," 2013 IEEE Seventh International Conference on Semantic Computing(ICSC), Irvine, CA, USA USA, 2013, pp. 78-85.
doi:10.1109/ICSC.2013.22
180 ms
(Ver 3.3 (11022016))