Matching with a hierarchical ontology

Yaacov Choueka; Nachum Dershowitz; Liad Tal

doi:10.1007/978-3-642-45321-2_17

Matching with a hierarchical ontology

Yaacov Choueka, Nachum Dershowitz, Liad Tal

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We describe how hierarchical ontologies are used for classifying products, as well as for answering queries. For classifying and scoring product descriptions and queries in an electronic-commerce search engine, we make use of declarative subset/superset and part/whole hierarchies, such as the sense hierarchies provided by WordNet. Retrieval is also aided by use of the ontology. Results of experiments were encouraging.

Original language	English
Pages (from-to)	395-398
Number of pages	4
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8001
DOIs	https://doi.org/10.1007/978-3-642-45321-2_17
State	Published - 2014

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2014.

Keywords

Ecommerce
Ontologies
Search

Access to Document

10.1007/978-3-642-45321-2_17

Cite this

@article{c6eb162348364fd98c27887db3317fd6,

title = "Matching with a hierarchical ontology",

abstract = "We describe how hierarchical ontologies are used for classifying products, as well as for answering queries. For classifying and scoring product descriptions and queries in an electronic-commerce search engine, we make use of declarative subset/superset and part/whole hierarchies, such as the sense hierarchies provided by WordNet. Retrieval is also aided by use of the ontology. Results of experiments were encouraging.",

keywords = "Ecommerce, Ontologies, Search",

author = "Yaacov Choueka and Nachum Dershowitz and Liad Tal",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2014.",

year = "2014",

doi = "10.1007/978-3-642-45321-2_17",

language = "אנגלית",

volume = "8001",

pages = "395--398",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - Matching with a hierarchical ontology

AU - Choueka, Yaacov

AU - Dershowitz, Nachum

AU - Tal, Liad

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2014.

PY - 2014

Y1 - 2014

N2 - We describe how hierarchical ontologies are used for classifying products, as well as for answering queries. For classifying and scoring product descriptions and queries in an electronic-commerce search engine, we make use of declarative subset/superset and part/whole hierarchies, such as the sense hierarchies provided by WordNet. Retrieval is also aided by use of the ontology. Results of experiments were encouraging.

AB - We describe how hierarchical ontologies are used for classifying products, as well as for answering queries. For classifying and scoring product descriptions and queries in an electronic-commerce search engine, we make use of declarative subset/superset and part/whole hierarchies, such as the sense hierarchies provided by WordNet. Retrieval is also aided by use of the ontology. Results of experiments were encouraging.

KW - Ecommerce

KW - Ontologies

KW - Search

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

U2 - 10.1007/978-3-642-45321-2_17

DO - 10.1007/978-3-642-45321-2_17

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84916242651

SN - 0302-9743

VL - 8001

SP - 395

EP - 398

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

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

ER -

Matching with a hierarchical ontology

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this