Maintaining Evidential Frequent Itemsets in Case of Data Deletion

  title={Maintaining Evidential Frequent Itemsets in Case of Data Deletion},
  author={Mohamed Anis Bach Tobji and Boutheina Ben Yaghlane},
Incremental Maintenance of Frequent Itemsets (IMFI) consists in maintaining a set of extracted patterns when mined data are updated. This field knew considerable improvement in the last decade. However, it is not sufficiently tackled when mined data are imperfect, especially where imperfection is modelled by the evidence theory. In this work, we maintain incrementally the set of initially extracted itemsets both in cases of insertion and deletion of evidential data. Experimentations led on our… 
1 Citations

Efficient Skyline Maintenance over Frequently Updated Evidential Databases

This paper addresses the problem of the maintenance of the skyline objects of frequently updated evidential databases by proposing algorithms for maintaining evidential skyline in the case of object insertion or deletion.



Incremental Maintenance of Frequent Itemsets in Evidential Databases

This paper introduces a new maintenance method whose experimentations show efficiency compared to classic methods and tries to resolve the problem of Incremental Maintenance of Frequent Itemsets (IMFI) in the context of evidential data.

A New Algorithm for Mining Frequent Itemsets from Evidential Databases

A new algorithm for mining frequent itemsets from evidential databases called RidLists is proposed that is the vertical representation of the evidential database and adapted to itemsets belief computation which makes the mining algorithm more ecient.

Efficient Mining of Frequent Patterns from Uncertain Data

This work proposes a tree-based mining algorithm to efficiently find frequent patterns from uncertain data, where each item in the transactions is associated with an existential probability.

Maintenance of discovered association rules in large databases: an incremental updating technique

An incremental updating technique is developed for maintenance of the association rules discovered by database mining when new transaction data are added to a transaction database.

Incremental Mining on Association Rules

Previously proposed algorithms for deriving precise association rules efficiently and effectively in dynamic transaction databases and approaches to generate approximations from data streams have received a significant amount of research attention recently.

Query Processing in Temporal Evidential Databases

The temporal evidential database (TED) model, which incorporates time into the evidential relational database model, is presented and it is shown how to integrate the evaluations of both temporal and non-temporal predicates in query processing.

Fast algorithms for mining association rules

Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.

Mining Association Rules under Imprecision and Vagueness: towards a Possibilistic Approach

A generalized possibilistic relational model is first proposed in this paper and it is proposed to enlarge this framework and consider imprecise and uncertain quantitative data.

"Secure" Logistic Regression of Horizontally and Vertically Partitioned Distributed Databases

This work describes "secure" Newton- Raphson protocol for binary logistic regression in the case of horizontally and vertically partitioned databases using secure-mulity party computation and draws from both PPDM and SDL paradigms.

Fuzzy association rules and the extended mining algorithms