2009
DOI: 10.1007/978-3-642-00958-7_23
|View full text |Cite
|
Sign up to set email alerts
|

Model Fusion in Conceptual Language Modeling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
3
2
1

Relationship

3
3

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…Based on the language model defined over the graph proposed in [15], we present in this paper an extension that handles set of concept sets and set of relation sets. The probability for a query image graph G Iq = < S Iq WC f , S Iq WE > to be generated from one document image graph G Id can be written as:…”
Section: Language Model For Graph Matchingmentioning
confidence: 99%
See 2 more Smart Citations
“…Based on the language model defined over the graph proposed in [15], we present in this paper an extension that handles set of concept sets and set of relation sets. The probability for a query image graph G Iq = < S Iq WC f , S Iq WE > to be generated from one document image graph G Id can be written as:…”
Section: Language Model For Graph Matchingmentioning
confidence: 99%
“…where #(c, Iq) denotes the number of times concept c occurs in the image query graph. This contribution corresponds to the concept probability as proposed in [15]. Similar to the previous work, the quantity P(c|G Id ) is estimated through maximum likelihood using Jelinek-Mercer smoothing:…”
Section: Concept Set Generationmentioning
confidence: 99%
See 1 more Smart Citation
“…The definitions of the functions F d and F D in the above equations are similar to the ones seen previously, but concern labels. The model we have just presented is inspired by the model defined in [6]. It differs however from it in (a) we propose in this paper a complete methodology for automatically indexing images at a conceptual level, and (b) it takes into account weights on each concept and association.…”
Section: A Language Model For Graph Matchingmentioning
confidence: 99%
“…Thus, Gao et al [2] proposes (a) the use of a dependency parser to represent documents and queries, and (b) an extension of the language modeling approach to deal with such trees. Maisonnasse [6] further extend this approach with a compatible model for general graphs, as the ones obtained by a conceptual analysis of documents and queries. We rely here on this latter models, however extending it by (a) applying it to an image collections, and (b) considering that both concepts and relations can be weighted.…”
Section: Introductionmentioning
confidence: 99%