Browsing-Oriented Semantic Faceted Search
Identifieur interne : 000366 ( Main/Exploration ); précédent : 000365; suivant : 000367Browsing-Oriented Semantic Faceted Search
Auteurs : Andreas Wagner [Allemagne, États-Unis] ; Günter Ladwig [Allemagne, États-Unis] ; Thanh Tran [Allemagne, États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
English descriptors
- Teeft :
- Atomic formulae, Baseline, Basic facet tree, Binding segment, Binding segments, Complex information, Comprehensible result, Conceptual dimensions, Conjunctive, Conjunctive queries, Conjunctive query, Current result, Data graph, Data value, Data value tree, Data value trees, Data values, Distinguishability, Dynamic faceted search, Edge distance, Expansion operations, Facet, Facet list, Facet model, Facet operations, Facet path, Facet paths, Facet tree, Facet trees, Facet value, Facet value sets, Facet value space, Facet value spaces, Facet values, Faceted, Faceted search, Focus selection, Further query predicates, Fuzzy information, Fuzzy need, Grouping facets, Height balance, Hierarchical representation, Information need, Irrelevant results, Ladwig, Large amount, Large number, Large result sets, Last facet operation, Leaf level, Leaf node, Leaf nodes, Mary paul, Maximum height, Metrics, More time, Node, Observable result, Participant, Precise background knowledge, Precise information, Precise information need, Precise knowledge, Precise need, Predicate, Query, Query model, Query predicate, Query predicates, Ranking, Ranking facets, Ranking scheme, Relation facet, Result size, Root node, Search paradigm, Search process, Semantic faceted search, Semantic wikis, Success rate, Such approaches, Time span, Tran, Uniform steps, Unknown collection, User, User costs, Variable bindings.
Abstract
Abstract: Faceted search enables users to browse and discover relevant items from a large collection such as the Web of data. Existing faceted search solutions assume a precise information need, and thus optimise relevance, interestingness, and costs of fulfilling an information need. In this paper, we propose a complementary solution. Instead of assuming a search scenario (i.e., a user has a precise information need), our solution targets a browsing scenario (i.e., a user has a fuzzy need). We aim to support users in exploring an unknown collection of items, thereby allowing them to discover new or unfamiliar items of interest. Our approach comprises mechanisms for grouping facets and facet values and facet ranking. Via a task-based evaluation, we demonstrate that the proposed solution enables more effective browsing compared to the state-of-the-art, given fuzzy information needs.
Url:
DOI: 10.1007/978-3-642-23088-2_22
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001647
- to stream Istex, to step Curation: 001545
- to stream Istex, to step Checkpoint: 000227
- to stream Main, to step Merge: 000366
- to stream Main, to step Curation: 000366
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Browsing-Oriented Semantic Faceted Search</title><author><name sortKey="Wagner, Andreas" sort="Wagner, Andreas" uniqKey="Wagner A" first="Andreas" last="Wagner">Andreas Wagner</name></author><author><name sortKey="Ladwig, Gunter" sort="Ladwig, Gunter" uniqKey="Ladwig G" first="Günter" last="Ladwig">Günter Ladwig</name></author><author><name sortKey="Tran, Thanh" sort="Tran, Thanh" uniqKey="Tran T" first="Thanh" last="Tran">Thanh Tran</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D9A6DA2AE9B4CFB744F7D93A326330339535FBD2</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-23088-2_22</idno><idno type="url">https://api.istex.fr/document/D9A6DA2AE9B4CFB744F7D93A326330339535FBD2/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001647</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001647</idno><idno type="wicri:Area/Istex/Curation">001545</idno><idno type="wicri:Area/Istex/Checkpoint">000227</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000227</idno><idno type="wicri:doubleKey">0302-9743:2011:Wagner A:browsing:oriented:semantic</idno><idno type="wicri:Area/Main/Merge">000366</idno><idno type="wicri:Area/Main/Curation">000366</idno><idno type="wicri:Area/Main/Exploration">000366</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Browsing-Oriented Semantic Faceted Search</title><author><name sortKey="Wagner, Andreas" sort="Wagner, Andreas" uniqKey="Wagner A" first="Andreas" last="Wagner">Andreas Wagner</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institute AIFB, Karlsruhe Institute of Technology</wicri:regionArea><wicri:noRegion>Karlsruhe Institute of Technology</wicri:noRegion><wicri:noRegion>Karlsruhe Institute of Technology</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Ladwig, Gunter" sort="Ladwig, Gunter" uniqKey="Ladwig G" first="Günter" last="Ladwig">Günter Ladwig</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institute AIFB, Karlsruhe Institute of Technology</wicri:regionArea><wicri:noRegion>Karlsruhe Institute of Technology</wicri:noRegion><wicri:noRegion>Karlsruhe Institute of Technology</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Tran, Thanh" sort="Tran, Thanh" uniqKey="Tran T" first="Thanh" last="Tran">Thanh Tran</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institute AIFB, Karlsruhe Institute of Technology</wicri:regionArea><wicri:noRegion>Karlsruhe Institute of Technology</wicri:noRegion><wicri:noRegion>Karlsruhe Institute of Technology</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Atomic formulae</term><term>Baseline</term><term>Basic facet tree</term><term>Binding segment</term><term>Binding segments</term><term>Complex information</term><term>Comprehensible result</term><term>Conceptual dimensions</term><term>Conjunctive</term><term>Conjunctive queries</term><term>Conjunctive query</term><term>Current result</term><term>Data graph</term><term>Data value</term><term>Data value tree</term><term>Data value trees</term><term>Data values</term><term>Distinguishability</term><term>Dynamic faceted search</term><term>Edge distance</term><term>Expansion operations</term><term>Facet</term><term>Facet list</term><term>Facet model</term><term>Facet operations</term><term>Facet path</term><term>Facet paths</term><term>Facet tree</term><term>Facet trees</term><term>Facet value</term><term>Facet value sets</term><term>Facet value space</term><term>Facet value spaces</term><term>Facet values</term><term>Faceted</term><term>Faceted search</term><term>Focus selection</term><term>Further query predicates</term><term>Fuzzy information</term><term>Fuzzy need</term><term>Grouping facets</term><term>Height balance</term><term>Hierarchical representation</term><term>Information need</term><term>Irrelevant results</term><term>Ladwig</term><term>Large amount</term><term>Large number</term><term>Large result sets</term><term>Last facet operation</term><term>Leaf level</term><term>Leaf node</term><term>Leaf nodes</term><term>Mary paul</term><term>Maximum height</term><term>Metrics</term><term>More time</term><term>Node</term><term>Observable result</term><term>Participant</term><term>Precise background knowledge</term><term>Precise information</term><term>Precise information need</term><term>Precise knowledge</term><term>Precise need</term><term>Predicate</term><term>Query</term><term>Query model</term><term>Query predicate</term><term>Query predicates</term><term>Ranking</term><term>Ranking facets</term><term>Ranking scheme</term><term>Relation facet</term><term>Result size</term><term>Root node</term><term>Search paradigm</term><term>Search process</term><term>Semantic faceted search</term><term>Semantic wikis</term><term>Success rate</term><term>Such approaches</term><term>Time span</term><term>Tran</term><term>Uniform steps</term><term>Unknown collection</term><term>User</term><term>User costs</term><term>Variable bindings</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Faceted search enables users to browse and discover relevant items from a large collection such as the Web of data. Existing faceted search solutions assume a precise information need, and thus optimise relevance, interestingness, and costs of fulfilling an information need. In this paper, we propose a complementary solution. Instead of assuming a search scenario (i.e., a user has a precise information need), our solution targets a browsing scenario (i.e., a user has a fuzzy need). We aim to support users in exploring an unknown collection of items, thereby allowing them to discover new or unfamiliar items of interest. Our approach comprises mechanisms for grouping facets and facet values and facet ranking. Via a task-based evaluation, we demonstrate that the proposed solution enables more effective browsing compared to the state-of-the-art, given fuzzy information needs.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>États-Unis</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Wagner, Andreas" sort="Wagner, Andreas" uniqKey="Wagner A" first="Andreas" last="Wagner">Andreas Wagner</name></noRegion><name sortKey="Ladwig, Gunter" sort="Ladwig, Gunter" uniqKey="Ladwig G" first="Günter" last="Ladwig">Günter Ladwig</name><name sortKey="Tran, Thanh" sort="Tran, Thanh" uniqKey="Tran T" first="Thanh" last="Tran">Thanh Tran</name></country><country name="États-Unis"><noRegion><name sortKey="Wagner, Andreas" sort="Wagner, Andreas" uniqKey="Wagner A" first="Andreas" last="Wagner">Andreas Wagner</name></noRegion><name sortKey="Ladwig, Gunter" sort="Ladwig, Gunter" uniqKey="Ladwig G" first="Günter" last="Ladwig">Günter Ladwig</name><name sortKey="Tran, Thanh" sort="Tran, Thanh" uniqKey="Tran T" first="Thanh" last="Tran">Thanh Tran</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000366 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000366 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:D9A6DA2AE9B4CFB744F7D93A326330339535FBD2
|texte= Browsing-Oriented Semantic Faceted Search
}}
| This area was generated with Dilib version V0.6.33. |  |