Information Technology Reference
In-Depth Information
22. L. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained frequent
set queries: 2-var constraints. In 3rd SIGMOD'98 Workshop on Research Issues
in Data Mining and Knowledge Discovery (DMKD) , pages 157-168, Seattle, WA,
June 1998.
23. R. Meo, G. Psaila, and S. Ceri. A new sql-like operator for mining association
rules. In Proceedings of the 22nd International Conference on Very Large Databases
(VLDB '96) , Mumbai (Bombay), India, September 1996.
24. R. Ng, L. S. Lakshmanan, J. Han, and T. Mah. Exploratory mining via constrained
frequent set queries. In Proceedings of the 1999 ACM-SIGMOD International
Conference on Management of Data (SIGMOD '99) , pages 556-558, Philadelphia,
PA, USA, June 1999.
25. R. Ng, L. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning
optimizations of constrained associations rules. In Proceedings of 1998 ACM SIG-
MOD International Conference on Management of Data (SIGMOD '98) , Seattle,
Washington, USA, June 1998.
26. A. Savasere, E. Omiecinski, and S. Navathe. An e 2 cient algorithm for mining
association rules in large databases. In Proceedings of the 21st Conference on Very
Large Databases (VLDB '95) , pages 432-444, Zurich, Switzerland, September 1995.
27. R. Srikant and R. Agrawal. Mining generalized association rules. In Proceedings
of the 21st Conference on Very Large Databases (VLDB '95) ,Zurich, Switzerland,
September 1995.
28. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational
tables. In Proceedings of the 1996 ACM SIGMOD Conference on Management of
Data , Montreal, Canada, June 1996.
29. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item con-
straints. In Proceedings of the 3rd International Conference on KDD and Data
Mining (KDD '97) , Newport Beach, California, August 1997.
30. G. J. Williams and Z. Huang. Modelling the kdd process. Technical report, CSIRO
Division of Information Technology, GPO Box 664 Canberra ACT 2601 Australia,
Februar 1996.
31. R. Wirth, M. Borth, and J. Hipp. When distribution is part of the semantics:
A new problem class for distributed knowledge discovery. In Proceedings of the
PKDD 2001 Workshop on Ubiquitous Data Mining for Mobile and Distributed
Environments , pages 56-64, Freiburg, Germany, September 3-7 2001.
32. R. Wirth and J. Hipp. CRISP-DM: Towards a standard process modell for data
mining. In Proceedings of the 4th International Conference on the Practical Appli-
cations of Knowledge Discovery and Data Mining , pages 29-39, Manchester, UK,
April 2000.
33. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast
discovery of association rules. In Proceedings of the 3rd International Conference
on KDD and Data Mining (KDD '97) , Newport Beach, California, August 1997.
Search WWH ::




Custom Search