Searching for authors named "Baptiste Jeudy" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Constraint-Based Discovery of a Condensed Representation for Frequent Patterns
- …Abstract. Computing frequent itemsets and their frequencies from large boolean matrices (e.g., to derive association rules) has been one of the hot topics in data mining. Levelwise algorithms (e.g., the Apriori algorithm) have been proved effective for frequent itemsets mining from sparse data. Howe…
- Add To MetaCart
-
Using Constraints During Set Mining: Should We Prune or not?
- …Knowledge discovery in databases (KDD) is an interactive process that can be considered from a querying perspective. Within the inductive database framework, an inductive query on a database is a query that might return generalizations about the data e.g., frequent itemsets, association rules, data …
- Cited by 7 (1 self) – Add To MetaCart
-
Mining free itemsets under constraints
- …Computing frequent itemsets and their frequencies from large boolean matrices (e.g., to derive association rules) has been one of the hot topics in data mining. Levelwise algorithms (e.g., the APRIORI algorithm) have been proved effective for frequent itemset mining from sparse data. However, in man…
- Cited by 5 (1 self) – Add To MetaCart
-
Using condensed representations for interactive association rule mining
- …Abstract. Association rule mining is a popular data mining task. It has an interactive and iterative nature, i.e., the user has to refine his mining queries until he is satisfied with the discovered patterns. To support such an interactive process, we propose to optimize sequences of queries by mean…
- Cited by 8 (3 self) – Add To MetaCart
-
Towards the tractable discovery of association rules with negations
- …Abstract. Frequent association rules (e.g., A∧B ⇒ C to say that when properties A and B are true in a record then, C tends to be also true) have become a popular way to summarize huge datasets. The last 5 years, there has been a lot of research on association rule mining and more precisely, the trac…
- Cited by 2 (2 self) – Add To MetaCart
-
Constraint-based discovery and inductive queries: application to association rule mining
- …Abstract. Recently inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. Querying these databases needs for primitives to: (1) select, manipulate and query data, (2) select, manipulate and query “interesting ” patterns (i.e., those patterns t…
- Cited by 4 (1 self) – Add To MetaCart
-
Optimization of Association Rule Mining Queries
- …Levelwise algorithms (e.g., the Apriori algorithm) have been proved effective for association rule mining from sparse data. However, in many practical applications, the computation turns to be intractable for the user-given frequency threshold and the lack of focus leads to huge collections of frequ…
- Cited by 7 (4 self) – Add To MetaCart
Showing 1 through 7.
