Exploiting symmetry in relational similarity for ranking relational search results

Tomokazu Goto, Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishizuka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine retrieves a ranked list of words , where a word is assigned a high rank if the relation between A and B is highly similar to that between C and D. However, if C and D has numerous co-occurrences, then D is retrieved by existing relational search engines irrespective of the relation between A and B. To overcome this problem, we exploit the symmetry in relational similarity to rank the result set . To evaluate the proposed ranking method, we use a benchmark dataset of Scholastic Aptitude Test (SAT) word analogy questions. Our experiments show that the proposed ranking method improves the accuracy in answering SAT word analogy questions, thereby demonstrating its usefulness in practical applications.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages595-600
Number of pages6
Volume6230 LNAI
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event11th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2010 - Daegu
Duration: 2010 Aug 302010 Sep 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6230 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other11th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2010
CityDaegu
Period10/8/3010/9/2

Fingerprint

Search engines
Ranking
Search Engine
Symmetry
Analogy
Semantics
Paradigm
Query
Benchmark
Evaluate
Experiments
Experiment
Similarity

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Goto, T., Duc, N. T., Bollegala, D., & Ishizuka, M. (2010). Exploiting symmetry in relational similarity for ranking relational search results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6230 LNAI, pp. 595-600). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6230 LNAI). https://doi.org/10.1007/978-3-642-15246-7_55

Exploiting symmetry in relational similarity for ranking relational search results. / Goto, Tomokazu; Duc, Nguyen Tuan; Bollegala, Danushka; Ishizuka, Mitsuru.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6230 LNAI 2010. p. 595-600 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6230 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Goto, T, Duc, NT, Bollegala, D & Ishizuka, M 2010, Exploiting symmetry in relational similarity for ranking relational search results. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6230 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6230 LNAI, pp. 595-600, 11th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2010, Daegu, 10/8/30. https://doi.org/10.1007/978-3-642-15246-7_55
Goto T, Duc NT, Bollegala D, Ishizuka M. Exploiting symmetry in relational similarity for ranking relational search results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6230 LNAI. 2010. p. 595-600. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-15246-7_55
Goto, Tomokazu ; Duc, Nguyen Tuan ; Bollegala, Danushka ; Ishizuka, Mitsuru. / Exploiting symmetry in relational similarity for ranking relational search results. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6230 LNAI 2010. pp. 595-600 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{51fb04f4669447a397c377bf599fea56,
title = "Exploiting symmetry in relational similarity for ranking relational search results",
abstract = "Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine retrieves a ranked list of words , where a word is assigned a high rank if the relation between A and B is highly similar to that between C and D. However, if C and D has numerous co-occurrences, then D is retrieved by existing relational search engines irrespective of the relation between A and B. To overcome this problem, we exploit the symmetry in relational similarity to rank the result set . To evaluate the proposed ranking method, we use a benchmark dataset of Scholastic Aptitude Test (SAT) word analogy questions. Our experiments show that the proposed ranking method improves the accuracy in answering SAT word analogy questions, thereby demonstrating its usefulness in practical applications.",
author = "Tomokazu Goto and Duc, {Nguyen Tuan} and Danushka Bollegala and Mitsuru Ishizuka",
year = "2010",
doi = "10.1007/978-3-642-15246-7_55",
language = "English",
isbn = "3642152457",
volume = "6230 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "595--600",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Exploiting symmetry in relational similarity for ranking relational search results

AU - Goto, Tomokazu

AU - Duc, Nguyen Tuan

AU - Bollegala, Danushka

AU - Ishizuka, Mitsuru

PY - 2010

Y1 - 2010

N2 - Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine retrieves a ranked list of words , where a word is assigned a high rank if the relation between A and B is highly similar to that between C and D. However, if C and D has numerous co-occurrences, then D is retrieved by existing relational search engines irrespective of the relation between A and B. To overcome this problem, we exploit the symmetry in relational similarity to rank the result set . To evaluate the proposed ranking method, we use a benchmark dataset of Scholastic Aptitude Test (SAT) word analogy questions. Our experiments show that the proposed ranking method improves the accuracy in answering SAT word analogy questions, thereby demonstrating its usefulness in practical applications.

AB - Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine retrieves a ranked list of words , where a word is assigned a high rank if the relation between A and B is highly similar to that between C and D. However, if C and D has numerous co-occurrences, then D is retrieved by existing relational search engines irrespective of the relation between A and B. To overcome this problem, we exploit the symmetry in relational similarity to rank the result set . To evaluate the proposed ranking method, we use a benchmark dataset of Scholastic Aptitude Test (SAT) word analogy questions. Our experiments show that the proposed ranking method improves the accuracy in answering SAT word analogy questions, thereby demonstrating its usefulness in practical applications.

UR - http://www.scopus.com/inward/record.url?scp=78049272336&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049272336&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15246-7_55

DO - 10.1007/978-3-642-15246-7_55

M3 - Conference contribution

AN - SCOPUS:78049272336

SN - 3642152457

SN - 9783642152450

VL - 6230 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 595

EP - 600

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -