Boolean Expressions over Attribute Sets Lizhuang Zhao and Mohammed J. Zaki...  Home/Search
Context
Related
| rpi.edu/research/pdf/0605.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rpi.edu/research/tr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. For each category, we propose a closure operator that naturally leads to the concept of a closed boolean expression. The closed expressions and their minimal generators give the most specific and most general boolean ... (Update)
Active bibliography (related documents): More All
3.2: Unknown - Framework For Mining (Correct)
0.4: Mining Positive and Negative Association Rules: An.. - Maria-Luiza Antonie.. (2004) (Correct)
0.3: Reasoning about Sets using Redescription Mining - Mohammed Zaki Department (2005) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ over-blosom,
author = "Boolean Expressions Over",
title = "BLOSOM: A Framework for Mining Arbitrary",
url = "citeseer.ist.psu.edu/750915.html" }
Citations (may not include all citations):509 Introduction to Lattices and Order (context) - Davey, Priestley - 1990
400 Fast discovery of association rules (context) - Agrawal, Mannila et al. - 1996
274 Generalization as search (context) - Mitchell - 1982
129 Formal Concept Analysis: Mathematical Foundations (context) - Ganter, Wille - 1999
85 Discovering frequent closed itemsets for association rules - Pasquier, Bastide et al. - 1999
73 Mining the most interesting rules (context) - Bayardo, Agrawal - 1999
28 Exact learning boolean functions via the monotone theory - Bshouty - 1995
26 Concise representation of frequent patterns based on disjunc.. (context) - Kryszkiewicz - 2001
23 Mining frequent patterns with counting inference - Bastide, Taouil et al. - 2000
17 Discovering all most specific sentences - Gunopulos, Khardon et al. - 2003
16 free representations of frequent sets (context) - Calders, Goethals - 2003
8 Mining for strong negative associations in a large database .. - Savasere, Omiecinski et al. - 1998
5 Closure systems and their structure - Pfaltz, Jamison - 2001
4 Advances in frequent itemset mining implementations: report .. - Goethals, Zaki - 2003
3 Mining positive and negative association rules: An approach .. - Antonie, Zaiane - 2004
3 Turning cartwheels: An alternating algorithm for mining rede.. - Ramakrishnan, Kumar et al. - 2004
2 Reasoning about sets using redescription mining - Zaki, Ramakrishnan - 2005
2 Association rule mining: Mining generalised disjunctive asso.. (context) - Nanavati, Chitrapura et al. - 2001
2 Extracting minimal and closed monotone dnf formulas (context) - Shima, Mitsuishi et al. - 2004
2 cient mining of both positive and negative association rules (context) - Wu, Zhang et al. - 2004
1 Mining succinct systems of minimal generators of formal conc.. - Dong, Jiang et al. - 2005
Documents on the same site (http://www.cs.rpi.edu/research/tr.html): More
MIRAGE: A Framework for Mining, Exploring and Visualizing.. - Zaki, Phoophakdee (Correct)
Model Selection and Surface Merging in Reconstruction Algorithms - Bubna, Stewart (1997) (Correct)
G isn't C! - LabVIEW and G as a Computing Language Course - Krishnamoorthy, Schupp (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC