Using Relational Similarity between Word Pairs for Latent Relational Search on the Web

Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as an answer to the question mark (?) in the query {(Japan, Tokyo), (France, ?)} because the relation between Japan and Toky...

Full description

Bibliographic Details

Published in:	2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Vol. 1; pp. 196 - 199
Main Authors:	Duc, Nguyen Tuan, Bollegala, Danushka, Ishizuka, Mitsuru
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.08.2010
Subjects:	analogical search Clustering algorithms Companies Filters Frequency measurement Indexes latent relational search Logic gates Pattern clustering relational similarity Search engines Semantics Vectors
ISBN:	9781424484829, 1424484820
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!