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...

Celý popis

Podrobná bibliografia

Vydané v:	2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Ročník 1; s. 196 - 199
Hlavní autori:	Duc, Nguyen Tuan, Bollegala, Danushka, Ishizuka, Mitsuru
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.08.2010
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!