2005
DOI: 10.1007/s10115-005-0205-x
|View full text |Cite
|
Sign up to set email alerts
|

Mining the meaningful term conjunctions from materialised faceted taxonomies: algorithms and complexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
19
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
3
3

Relationship

3
3

Authors

Journals

citations
Cited by 11 publications
(20 citation statements)
references
References 15 publications
1
19
0
Order By: Relevance
“…satisfy condition (β = ), or reach to a compound terminology closer to S F e ) by an expression e with structure (parse tree) different than e. The answer is negative. At first note that previous work [21] has proved that if A is a subset of P(T ) such that Br(A) = A, then there is always an expression e such that S e = A. Moreover, we have shown that this is true, for every possible parse tree of e (i.e.…”
Section: Epiloguesupporting
confidence: 50%
See 2 more Smart Citations
“…satisfy condition (β = ), or reach to a compound terminology closer to S F e ) by an expression e with structure (parse tree) different than e. The answer is negative. At first note that previous work [21] has proved that if A is a subset of P(T ) such that Br(A) = A, then there is always an expression e such that S e = A. Moreover, we have shown that this is true, for every possible parse tree of e (i.e.…”
Section: Epiloguesupporting
confidence: 50%
“…The initial motivation for CTCA was to provide a well-founded method that is both flexible and economical (in terms of required input) and computationally efficient. One system based on CTCA has already been built [26], while other applications of CTCA are described in [20,22,21]. The semantics of CTCA differ from that of Description Logics (DL) [5] mainly because each operation of CTCA makes either a positive or a negative closed world assumption at its range, as it is shown in detail in [24].…”
Section: The Compound Term Composition Algebramentioning
confidence: 99%
See 1 more Smart Citation
“…The only constraint is that V should be an o-filter, that is if a compound term s is in V then all compound terms broader than s are also in V . Indeed, in [36], we show that for any compound terminology V that is an o-filter, there is a well-formed expression e of any expression form 3 such that S e = V .…”
Section: Algebraic Expressionsmentioning
confidence: 99%
“…Specifically, what he/she has to do is to formulate a CTCA expression e such that S e = V . Note that if we had a materialization of F that was "complete" -in the sense that the extension of every valid compound term is non-empty -then we could mine the expression e using the approach presented in [36] (this is called expression mining). However, we rarely have such a complete knowledge and certainly we do not have any materialization when we design the faceted taxonomy.…”
Section: Formulating the Expressionmentioning
confidence: 99%