Databases Reference
In-Depth Information
References
1. Agrawal R, Imielinski T, Swami A (1993) Mining association rules between
sets of items in large databases. In: Buneman P, Jajodia S (eds): Proceedings
of the 1993 ACM SIGMOD International Conference on Management of Data
(SIGMOD-93, ACM, New York, NY), Washington, DC, United States, May
1993. (pages 207-216)
2. Agrawal R, Srikant R (1994) Fast algorithm for mining association rules. In:
Bocca JB, Jarke M, Zaniolo C (eds): Proceedings of the 20th International
Conference on Very Large Data Bases (VLDB-94, Morgan Kaufmann, San
Francisco, CA), Santiago de Chile, Chile, September 1994. (ISBN 1-55860-153-
8, pages 487-499)
3. Ali K, Manganaris S, Srikant R (1997) Partial classification using association
rules. In: Heckerman D, Mannila H, Pregibon D, Uthurusamy R (eds): Pro-
ceedings of the Third International Conference on Knowledge Discovery and
Data Mining (KDD-97, AAAI, Menlo Park, CA), Newport Beach, California,
United States, August 1997. (ISBN 1-57735-027-8, pages 115-118)
4. Blake CL, Merz CJ (1998) UCI repository of machine learning databases.
http://www.ics.uci.edu/ mlearn/MLRepository.html, Irvine, CA: University of
California, Department of Information and Computer Science
5. Bong CH, Narayanan K (2004) An empirical study of feature selection for
text categorization based on term weightage. In: Proceedings of the 2004
IEEE/WIC/ACM International Conference on Web Intelligence (WI-04, IEEE
Computer Society), Beijing, China, September 2004. (ISBN 0-7695-2100-2,
pages 599-602)
6. Boser BE, Guyon IM, Vapnik VN (1992) A training algorithm for optimal mar-
gin classifiers. In: Haussler D (ed): Proceedings of the fifth ACM Annual Work-
shop on Computational Learning Theory (COLT-92, ACM, New York, NY),
Pittsburgh, Pennsylvania, United States, July 1992. (ISBN 0-89791-497-X,
pages 144-152)
7. Brin S, Motwani R, Ullman JD, Tsur S (1997) Dynamic itemset counting and
implication rules for market basket data. In: Peckham J (ed): Proceedings of
the 1997 ACM SIGMOD International Conference on Management of Data
(SIGMOD-97, ACM, New York, NY), Tucson, Arizona, United States, May
1997. (SIGMOD Record 26(2), pages 255-264)
8. Burdick D, Calimlim M, Gehrke J (2001) MAFIA: A maximal frequent item-
set algorithm for transactional databases. In: Proceedings of the 17th Interna-
tional Conference on Data Engineering (ICDE-01, IEEE Computer Society),
Heidelberg, Germany, April 2001. (ISBN 0-7695-1001-9, pages 443-452)
9. Cheung W, Zaıane OR (2003) Incremental mining of frequent patterns without
candidate generation or support constrain. In: Seventh International Database
Engineering and Applications Symposium (IDEAS-03, IEEE Computer Soci-
ety), Hong Kong, China, July 2003. (ISBN 0-7695-1981-4, pages 111-116)
10. Clark P, Boswell R (1991) Rule induction with CN2: Some recent improve-
ments. In: Kodratoff Y (ed): Machine Learning - Proceedings of the Fifth Eu-
ropean Working Session on Learning (EWSL-91, Springer, Berlin Heidelberg
New York), Porto, Portugal, March 1991. (LNAI 482, ISBN 3-540-53816-X,
pages 151-163)
