Access the full text.
Sign up today, get DeepDyve free for 14 days.
Jianyong Wang, Jiawei Han, J. Pei (2003)
CLOSET+: searching for the best strategies for mining frequent closed itemsets
J. Pei, Jiawei Han, L. Lakshmanan (2001)
Mining frequent itemsets with convertible constraintsProceedings 17th International Conference on Data Engineering
Jiawei Han (2007)
IntroductionACM Trans. Knowl. Discov. Data, 1
Lizhuang Zhao, Mohammed Zaki (2005)
TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data
J. Besson, C. Robardet, Jean-François Boulicaut, S. Rome (2005)
Constraint-based concept mining and its application to microarray data analysisIntell. Data Anal., 9
L. Cerf, J. Besson, C. Robardet, Jean-François Boulicaut (2008)
Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations
Alain Gély (2005)
A Generic Algorithm for Generating Closed Sets of a Binary Relation
N. Biswas (1971)
Minimization of Boolean FunctionsIEEE Transactions on Computers, C-20
R. Agrawal, R. Srikant (1994)
Fast Algorithms for Mining Association Rules in Large Databases
Nicolas Pasquier, Yves Bastide, Rafik Taouil, L. Lakhal (1999)
Efficient Mining of Association Rules Using Closed Itemset LatticesInf. Syst., 24
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, L. Lakhal (2002)
Computing iceberg concept lattices with TData Knowl. Eng., 42
(1985)
Espresso-MV: Algorithms for multiple valued logic minimization
T. Uno, Masashi Kiyomi, Hiroki Arimura (2005)
LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining
R. Pensa, Jean-François Boulicaut (2004)
Boolean Property Encoding for Local Set Pattern Discovery: An Application to Gene Expression Data Analysis
R. Wille (2009)
Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
M. Karnaugh (1953)
The map method for synthesis of combinational logic circuitsTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 72
(2008)
Received April
Song Bao (2003)
Mining Frequent Item Sets with Multiple Convertible ConstraintsComputer Science
(2009)
Closed patterns meet n - ary relations
R. Ng, L. Lakshmanan, Jiawei Han, Alex Pang (1998)
Exploratory mining and pruning optimizations of constrained associations rules, 27
(2006)
Mining frequent closed cubes in 3 D data sets . In Proceedings of the 32 nd International Conference on Very Large Data Bases ( VLDB ’ 06 )
G. Garriga, R. Khardon, L. Raedt (2007)
On Mining Closed Sets in Multi-Relational Data
F. Afrati, Gautam Das, A. Gionis, H. Mannila, Taneli Mielikäinen, Panayiotis Tsaparas (2005)
Mining chains of relationsFifth IEEE International Conference on Data Mining (ICDM'05)
Feng Pan, G. Cong, A. Tung, Jiong Yang, Mohammed Zaki (2003)
Carpenter: finding closed patterns in long biological datasets
Liping Ji, K. Tan, A. Tung (2006)
Mining frequent closed cubes in 3D datasets
R. Jäschke, A. Hotho, Christoph Schmitz, B. Ganter, Gerd Stumme (2006)
TRIAS--An Algorithm for Mining Iceberg Tri-LatticesSixth International Conference on Data Mining (ICDM'06)
Jimeng Sun, D. Tao, C. Faloutsos (2006)
Beyond streams and graphs: dynamic tensor analysis
(2009)
Article 3, Publication date
Bart Goethals, Mohammed Zaki (2004)
Advances in frequent itemset mining implementations: report on FIMI'03SIGKDD Explor., 6
LATTICESyNicolas, Pasquier, Yves Bastide, Rafik Taouil, Lotfi, LakhalLaboratoire (2008)
EFFICIENT MINING OF ASSOCIATION RULESUSING CLOSED ITEMSET
R. Agrawal, T. Imielinski, A. Swami (1993)
Mining association rules between sets of items in large databasesProceedings of the 1993 ACM SIGMOD international conference on Management of data
D. Jiang, J. Pei, M. Ramanathan, Chun Tang, A. Zhang (2004)
Mining coherent gene clusters from gene-sample-time microarray dataProceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Jiawei Han, J. Pei, Yiwen Yin (2000)
Mining frequent patterns without candidate generation
G. Grahne, Jianfei Zhu (2005)
Fast algorithms for frequent itemset mining using FP-treesIEEE Transactions on Knowledge and Data Engineering, 17
Jean-François Boulicaut, Baptiste Jeudy (2005)
Constraint-based Data Mining
Mohammed Zaki, Ching-Jui Hsiao (2002)
CHARM: An Efficient Algorithm for Closed Itemset Mining
J. Pei, Jiawei Han, Runying Mao (2000)
CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets
(2000)
MVSIS . In Notes of the IEEE International Workshop on Logic Synthesis
Set pattern discovery from binary relations has been extensively studied during the last decade. In particular, many complete and efficient algorithms for frequent closed set mining are now available. Generalizing such a task to n -ary relations ( n ≥ 2) appears as a timely challenge. It may be important for many applications, for example, when adding the time dimension to the popular objects × features binary case. The generality of the task (no assumption being made on the relation arity or on the size of its attribute domains) makes it computationally challenging. We introduce an algorithm called Data-Peeler. From an n -ary relation, it extracts all closed n -sets satisfying given piecewise (anti) monotonic constraints. This new class of constraints generalizes both monotonic and antimonotonic constraints. Considering the special case of ternary relations, Data-Peeler outperforms the state-of-the-art algorithms CubeMiner and Trias by orders of magnitude. These good performances must be granted to a new clever enumeration strategy allowing to efficiently enforce the closeness property. The relevance of the extracted closed n -sets is assessed on real-life 3-and 4-ary relations. Beyond natural 3-or 4-ary relations, expanding a relation with an additional attribute can help in enforcing rather abstract constraints such as the robustness with respect to binarization. Furthermore, a collection of closed n -sets is shown to be an excellent starting point to compute a tiling of the dataset.
ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery
Published: Mar 1, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.