Proceedings of the 3rd ACM Conference on International Conference on Multimedia Retrieval 2013
DOI: 10.1145/2461466.2461511
|View full text |Cite
|
Sign up to set email alerts
|

Multimedia information seeking through search and hyperlinking

Abstract: Searching for relevant webpages and following hyperlinks to related content is a widely accepted and effective approach to information seeking on the textual web. Existing work on multimedia information retrieval has focused on search for individual relevant items or on content linking without specific attention to search results. We describe our research exploring integrated multimodal search and hyperlinking for multimedia data. Our investigation is based on the MediaEval 2012 Search and Hyperlinking task. T… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
1

Year Published

2014
2014
2019
2019

Publication Types

Select...
7
2

Relationship

4
5

Authors

Journals

citations
Cited by 40 publications
(28 citation statements)
references
References 26 publications
0
27
1
Order By: Relevance
“…By following links (that can be seen as user-independent recommendations), the user is able to navigate in an informed way, choosing his next step among a limited set of links that are related to the news item he is currently viewing [4]. When carefully cra ed, those links can provide a highly navigable structure, as evidenced in a number of application domains [16], including news [11].…”
Section: Hyperlinking and Graph Representationsmentioning
confidence: 99%
See 1 more Smart Citation
“…By following links (that can be seen as user-independent recommendations), the user is able to navigate in an informed way, choosing his next step among a limited set of links that are related to the news item he is currently viewing [4]. When carefully cra ed, those links can provide a highly navigable structure, as evidenced in a number of application domains [16], including news [11].…”
Section: Hyperlinking and Graph Representationsmentioning
confidence: 99%
“…Navigable graphs allow for interesting applications, such as connecting the dots between two arbitrary pieces of information [17]. In the absence of pre-de ned segments acting as the source of the links-the so-called anchors in [4]-, there are two main algorithms to create graphs that connect documents with hyperlinks: K nearest neighbors (K-NN) and E nearest neighbors (E-NN) graphs. Both consist in creating links between related elements, called (nearest) neighbors, in a collection, relying on a content-based distance function that measures how similar two documents are.…”
Section: Hyperlinking and Graph Representationsmentioning
confidence: 99%
“…Evaluations on video hyperlinking over the past few years, e.g., [5], are typically first step in this direction. Clearly, analytics cannot satisfy itself of documents taken regardless of the collection.…”
Section: Links and Recommendationmentioning
confidence: 99%
“…The automatic generation of hyperlinks within video collections recently became a major subject, in particular via evaluation benchmarks within MediaEval and TRECVid [9,8,18]. The key idea is to create hyperlinks between video segments within a collection, enriching a set of anchors that represent interesting entry points in the collection.…”
Section: Introductionmentioning
confidence: 99%