2008
DOI: 10.1007/978-3-540-87993-0_4
|View full text |Cite
|
Sign up to set email alerts
|

Frequent Itemset Mining from Databases Including One Evidential Attribute

Abstract: Abstract. Frequent Itemset Mining (FIM) problem has been extensively tackled in the context of perfect data. However, real applications showed that data are often imperfect (incomplete and/or uncertain) which leads to the need of FIM algorithms that process imperfect databases. In this paper we propose a new algorithm for mining frequent itemsets from databases including exactly one evidential attribute. An evidential attribute is an attribute that could have uncertain values modelled via the evidence theory, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…This model opens up the way for further researches on querying possible worlds' model to validate existing querying methods based on the compact form with the aim of proving the strong representation system relative to evidential databases.…”
Section: Discussionmentioning
confidence: 99%
“…This model opens up the way for further researches on querying possible worlds' model to validate existing querying methods based on the compact form with the aim of proving the strong representation system relative to evidential databases.…”
Section: Discussionmentioning
confidence: 99%
“…In [8], tests were conducted on synthetic database. Even in [15], the constructed BBA includes only one evidential attributes. In [9], the authors worked on a simplified naval anti-surface warfare scenario.…”
Section: Evidential Database Constructionmentioning
confidence: 99%