Constraint-based mining of Web page associations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4830 LNAI, Issue , 2007, Pages 315-326

  El Hajj, Mohammad ^a   Chen, Jiyang ^a   Zafane, Osmar R ^a   Goebel, Randy ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA STRUCTURES; HEURISTIC METHODS; LEARNING SYSTEMS; WEBSITES;

CONSTRAINT BASED MINING; RULE MINING; WEB PAGE ASSOCIATIONS;

DATA MINING;

EID: 38349049563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76928-6_33     Document Type: Conference Paper

References (11)

1. Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Examiner: Optimized level-wise frequent pattern mining with monotone constraints. In: IEEE ICDM, Melbourne, Florida (November 2004)
2. Bonchi, F., Goethals, B.: Fp-bonsai: the art of growing and pruning small fp-trees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 155-160. Springer, Heidelberg (2004)
3. Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol. 3275, Springer, Heidelberg (2004)
4. Bucila, C., Gehrke, J., Kifer, D., White, W.: Dualminer: A dual-pruning algorithm for itemsets with constraints. In: Eight ACM SIGKDD Internationa Conf. on Knowledge Discovery and Data Mining, Edmonton, Alberta, pp. 42-51 (August 2002)
5. Burdick, D., Calimlim, M., Gehrke, J.: Mafia: A maximal frequent itemset algorithm for transactional databases. In: ICDE, pp. 443-452 (2001)
6. Chi, E.H., Pitkow, J., Mackinlay, J., Pirolli, P., Gossweiler, R., Card, S.K.: Visualizing the evolution of web ecologies. In: CHI 1998. Proceedings of the Conference on Human Factors in Computing Systems (1998)
7. El-Hajj, M., Zaïane, O.R.: Non recursive generation of frequent k-itemsets from frequent pattern tree representations. In: Kambayashi, Y., Mohania, M.K., Wöß, W. (eds.) DaWak 2003. LNCS, vol. 2737, Springer, Heidelberg (2003)
8. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J., Bernstein, P.A. (eds.) ACM SIGMOD Intl. Conference on Management of Data, vol. 05, pp. 1-12. ACM Press, New York (2000)
9. Lakshmanan, L. V., Ng, R., Han, J., Pang, A.: Optimization of constrained frequent set queries with 2-variable constraints. In: ACM SIGMOD Conference on Management of Data, pp. 157-168 (1999)
10. Pei, J., Han, J., Lakshmanan, L.V.: Mining frequent itemsets with convertible constraints. In: IEEE ICDE Conference, pp. 433-442 (2001)
11. Ting, R.M.H., Bailey, J., Ramamohanarao, K.: Paradualminer: An efficient parallel implementation of the dualminer algorithm. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD2004. LNCS (LNAI), vol. 3056, pp. 96-105. Springer, Heidelberg (2004)