Loading…
Semantic flooding: Search over semantic links
Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one level above. In turn, multiple classification hierarchies can be connected by semantic links which represent mappings among them and...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 196 |
container_issue | |
container_start_page | 191 |
container_title | |
container_volume | |
creator | Giunchiglia, Fausto Kharkevich, Uladzimir Hume, Alethia Chatvorawit, Piyatat |
description | Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one level above. In turn, multiple classification hierarchies can be connected by semantic links which represent mappings among them and which can be computed, e.g., by ontology matching. In this paper we describe how these two types of links can be used to define a semantic overlay network which can cover any number of peers and which can be flooded to perform semantic search on documents, i.e., to perform semantic flooding. We have evaluated our approach in a simulation of the network of 10,000 peers containing classifications which are fragments of the DMoz Web directory. The results are very promising and show that, in our approach, only a relatively small number of peers needs to be queried in order to achieve high accuracy. |
doi_str_mv | 10.1109/ICDEW.2010.5452749 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5452749</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5452749</ieee_id><sourcerecordid>5452749</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-2561f61994cc18064dd9adf52b42c06c31f0e2c87a3d8fe8dda598cdaf42e86b3</originalsourceid><addsrcrecordid>eNpFj0FLAzEUhCMiqLV_QC_7B7bmvbxkE2-ytlooeKjisaTJi0a3u7JbBP-9C1acy_Axw8AIcQlyBiDd9bK-m7_MUI6sSWNF7kicAyGR0ajk8T8gnorpMLzLUWNTAp2Jcs073-5zKFLTdTG3rzfFmn0f3orui_ti-Iub3H4MF-Ik-Wbg6cEn4nkxf6ofytXj_bK-XZUZKr0vURtIBpyjEMBKQzE6H5PGLWGQJihIkjHYyqtoE9sYvXY2RJ8I2Zqtmoir393MzJvPPu98_7053FM_-MZDOw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Semantic flooding: Search over semantic links</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Giunchiglia, Fausto ; Kharkevich, Uladzimir ; Hume, Alethia ; Chatvorawit, Piyatat</creator><creatorcontrib>Giunchiglia, Fausto ; Kharkevich, Uladzimir ; Hume, Alethia ; Chatvorawit, Piyatat</creatorcontrib><description>Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one level above. In turn, multiple classification hierarchies can be connected by semantic links which represent mappings among them and which can be computed, e.g., by ontology matching. In this paper we describe how these two types of links can be used to define a semantic overlay network which can cover any number of peers and which can be flooded to perform semantic search on documents, i.e., to perform semantic flooding. We have evaluated our approach in a simulation of the network of 10,000 peers containing classifications which are fragments of the DMoz Web directory. The results are very promising and show that, in our approach, only a relatively small number of peers needs to be queried in order to achieve high accuracy.</description><identifier>ISBN: 1424465222</identifier><identifier>ISBN: 9781424465224</identifier><identifier>EISBN: 1424465230</identifier><identifier>EISBN: 9781424465231</identifier><identifier>EISBN: 9781424465217</identifier><identifier>EISBN: 1424465214</identifier><identifier>DOI: 10.1109/ICDEW.2010.5452749</identifier><language>eng</language><publisher>IEEE</publisher><subject>Animals ; Classification tree analysis ; Computer science ; Distributed computing ; File systems ; Floods ; Humans ; Mice ; Ontologies ; Peer to peer computing</subject><ispartof>2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010), 2010, p.191-196</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5452749$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5452749$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Giunchiglia, Fausto</creatorcontrib><creatorcontrib>Kharkevich, Uladzimir</creatorcontrib><creatorcontrib>Hume, Alethia</creatorcontrib><creatorcontrib>Chatvorawit, Piyatat</creatorcontrib><title>Semantic flooding: Search over semantic links</title><title>2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)</title><addtitle>ICDEW</addtitle><description>Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one level above. In turn, multiple classification hierarchies can be connected by semantic links which represent mappings among them and which can be computed, e.g., by ontology matching. In this paper we describe how these two types of links can be used to define a semantic overlay network which can cover any number of peers and which can be flooded to perform semantic search on documents, i.e., to perform semantic flooding. We have evaluated our approach in a simulation of the network of 10,000 peers containing classifications which are fragments of the DMoz Web directory. The results are very promising and show that, in our approach, only a relatively small number of peers needs to be queried in order to achieve high accuracy.</description><subject>Animals</subject><subject>Classification tree analysis</subject><subject>Computer science</subject><subject>Distributed computing</subject><subject>File systems</subject><subject>Floods</subject><subject>Humans</subject><subject>Mice</subject><subject>Ontologies</subject><subject>Peer to peer computing</subject><isbn>1424465222</isbn><isbn>9781424465224</isbn><isbn>1424465230</isbn><isbn>9781424465231</isbn><isbn>9781424465217</isbn><isbn>1424465214</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpFj0FLAzEUhCMiqLV_QC_7B7bmvbxkE2-ytlooeKjisaTJi0a3u7JbBP-9C1acy_Axw8AIcQlyBiDd9bK-m7_MUI6sSWNF7kicAyGR0ajk8T8gnorpMLzLUWNTAp2Jcs073-5zKFLTdTG3rzfFmn0f3orui_ti-Iub3H4MF-Ik-Wbg6cEn4nkxf6ofytXj_bK-XZUZKr0vURtIBpyjEMBKQzE6H5PGLWGQJihIkjHYyqtoE9sYvXY2RJ8I2Zqtmoir393MzJvPPu98_7053FM_-MZDOw</recordid><startdate>201003</startdate><enddate>201003</enddate><creator>Giunchiglia, Fausto</creator><creator>Kharkevich, Uladzimir</creator><creator>Hume, Alethia</creator><creator>Chatvorawit, Piyatat</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201003</creationdate><title>Semantic flooding: Search over semantic links</title><author>Giunchiglia, Fausto ; Kharkevich, Uladzimir ; Hume, Alethia ; Chatvorawit, Piyatat</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-2561f61994cc18064dd9adf52b42c06c31f0e2c87a3d8fe8dda598cdaf42e86b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Animals</topic><topic>Classification tree analysis</topic><topic>Computer science</topic><topic>Distributed computing</topic><topic>File systems</topic><topic>Floods</topic><topic>Humans</topic><topic>Mice</topic><topic>Ontologies</topic><topic>Peer to peer computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Giunchiglia, Fausto</creatorcontrib><creatorcontrib>Kharkevich, Uladzimir</creatorcontrib><creatorcontrib>Hume, Alethia</creatorcontrib><creatorcontrib>Chatvorawit, Piyatat</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Giunchiglia, Fausto</au><au>Kharkevich, Uladzimir</au><au>Hume, Alethia</au><au>Chatvorawit, Piyatat</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Semantic flooding: Search over semantic links</atitle><btitle>2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)</btitle><stitle>ICDEW</stitle><date>2010-03</date><risdate>2010</risdate><spage>191</spage><epage>196</epage><pages>191-196</pages><isbn>1424465222</isbn><isbn>9781424465224</isbn><eisbn>1424465230</eisbn><eisbn>9781424465231</eisbn><eisbn>9781424465217</eisbn><eisbn>1424465214</eisbn><abstract>Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one level above. In turn, multiple classification hierarchies can be connected by semantic links which represent mappings among them and which can be computed, e.g., by ontology matching. In this paper we describe how these two types of links can be used to define a semantic overlay network which can cover any number of peers and which can be flooded to perform semantic search on documents, i.e., to perform semantic flooding. We have evaluated our approach in a simulation of the network of 10,000 peers containing classifications which are fragments of the DMoz Web directory. The results are very promising and show that, in our approach, only a relatively small number of peers needs to be queried in order to achieve high accuracy.</abstract><pub>IEEE</pub><doi>10.1109/ICDEW.2010.5452749</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 1424465222 |
ispartof | 2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010), 2010, p.191-196 |
issn | |
language | eng |
recordid | cdi_ieee_primary_5452749 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Animals Classification tree analysis Computer science Distributed computing File systems Floods Humans Mice Ontologies Peer to peer computing |
title | Semantic flooding: Search over semantic links |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T20%3A30%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Semantic%20flooding:%20Search%20over%20semantic%20links&rft.btitle=2010%20IEEE%2026th%20International%20Conference%20on%20Data%20Engineering%20Workshops%20(ICDEW%202010)&rft.au=Giunchiglia,%20Fausto&rft.date=2010-03&rft.spage=191&rft.epage=196&rft.pages=191-196&rft.isbn=1424465222&rft.isbn_list=9781424465224&rft_id=info:doi/10.1109/ICDEW.2010.5452749&rft.eisbn=1424465230&rft.eisbn_list=9781424465231&rft.eisbn_list=9781424465217&rft.eisbn_list=1424465214&rft_dat=%3Cieee_6IE%3E5452749%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-2561f61994cc18064dd9adf52b42c06c31f0e2c87a3d8fe8dda598cdaf42e86b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5452749&rfr_iscdi=true |