Explosion of the amount of personal information has made the technique of dataspaces search become a hot topic. However current search engines for dataspaces are becoming increasingly inadequate for the query tasks with users' diverse preferences. In this paper, we present a potential role based entity matching model called POEM. We respectively propose the strategies of homologous entity matching and heterogeneous entity matching, which can better utilize both entity features and entity relationships to match and organize entities. By combining homologous entity matching and heterogeneous entity matching, the query result can be adaptable to the diverse needs from different users. The experiments demonstrate the feasibility and effectiveness of the key techniques of POEM. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kou, Y., Shen, D., Nie, T., & Yu, G. (2010). Potential role based entity matching for dataspaces search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6488 LNCS, pp. 496–509). https://doi.org/10.1007/978-3-642-17616-6_44
Mendeley helps you to discover research relevant for your work.