A heuristic for mining association rules in polynomial time

Mathematical and Computer Modelling

Volumn 37, Issue 1-2, 2003, Pages 219-233

  Yilmaz, E ^a   Triantaphyllou, E ^b   Chen, J ^c   Liao, T W ^b  

^a GENERAL ELECTRIC COMPANY   (United States)

^b LOUISIANA STATE UNIVERSITY   (United States)

^c Louisiana State University   (United States)

Author keywords

Algorithm analysis; Association rules; Boolean functions; Data mining; Heuristics; One clause at a time (OCAT) approach; Randomized algorithms

Indexed keywords

EID: 0037418154     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(03)80016-X     Document Type: Article

References (14)

1. T. Blaxton and C. Westphal, Data Mining Solutions: Methods and Tools for Solving Real-World Problems, John Wiley & Sons, New York, (1998).
2. th VLDB Conference, Santiago, Chile (1994).
3. th International Conference on Data Engineering (1999).
4. R. Agrawal, T. Imielinski and A. Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD Conference, Washington, DC (1993).
5. M. Houtsma and A. Swami, Set oriented mining of association rules, Technical Report RJ 9567, IBM.
6. A. Savasere, E. Omiecinski and S. Navathe, An efficient algorithm for mining association rules in large databases, Data Mining Group, Tandem Computers, Inc., Austin, TX (1995).
7. th VLDB Conference, Bombay, India (1996).
8. A.S. Deshpande and E. Triantaphyllou, A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions, Mathl. Comput. Modelling 27 (1), 75-99 (1998).
9. J. Peysakh, A fast algorithm to convert Boolean expressions into CNF, IBM Computer Science RC 12913(#57971), Watson, NY (1987).
10. E. Triantaphyllou and A.L. Soyster, A relationship between CNF and DNF systems derivable from examples, ORSA Journal on Computing 7, 283-285 (1995).
11. E. Triantaphyllou, Inference of a minimum size Boolean function from examples by using a new efficient branch and bound approach, Journal of Global Optimization 5, 69-94 (1994).
12. E. Triantaphyllou, A.L. Soyster and S.R.T. Kumara, Generating logical expressions from positive and negative examples via a branch and bound approach, Computers and Operations Research 21, 185-197 (1994).
13. th International Conference on Data Engineering, Orlando, FL (1998).
14. C.J. Date, An Introduction to Database Systems, Addison-Wesley, Reading, MA, (1995).