Efficient discovery of top-K minimal jumping emerging patterns

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

Volumn 5306 LNAI, Issue , 2008, Pages 438-447

  Terlecki, Pawel ^a   Walczak, Krzysztof ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Attribute set dependence; CP Tree; Jumping emerging pattern; Rough sets; Strong jumping emerging patterns; Top k most interesting patterns

Indexed keywords

FORESTRY;

ATTRIBUTE SET DEPENDENCE; CP-TREE; JUMPING EMERGING PATTERN; STRONG JUMPING EMERGING PATTERNS; TOP-K MOST INTERESTING PATTERNS;

ROUGH SET THEORY;

EID: 57049141452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88425-5_45     Document Type: Conference Paper

References (14)

1. Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: KDD, pp. 43-52. ACM Press, New York (1999)
2. Fan, H., Ramamohanarao, K.: Fast discovery and the generalization of strong jumping emerging patterns for building compact and accurate classifiers. IEEE Trans. on Knowl. and Data Eng. 18(6), 721-737 (2006)
3. Li, J., Liu, G., Wong, L.: Mining statistically important equivalence classes and delta-discriminative emerging patterns. In: KDD, pp. 430-439 (2007)
4. Li, J., Dong, G., Ramamohanarao, K.: Making use of the most expressive jumping emerging patterns for classification. Knowl. Inf. Syst. 3(2), 1-29 (2001)
5. Terlecki, P., Walczak, K.: On the relation between rough set reducts and jumping emerging patterns. Information Sciences 177(1), 74-83 (2007)
6. Terlecki, P., Walczak, K.: Local projection in jumping emerging patterns discovery in transaction databases. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 723-730. Springer, Heidelberg (2008)
7. Terlecki, P., Walczak, K.: Attribute set dependence in apriori-like reduct computation. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 268-276. Springer, Heidelberg (2006)
8. Shen, L., Shen, H., Pritchard, P., Topor, R.: Finding the n largest itemsets. In: ICDM (1998)
9. Fu, A.W.-C., Kwong, R.W.-w., Tang, J.: Mining n-rnost interesting itemsets. In: Ohsuga, S., Ras, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol. 1932, pp. 59-67. Springer, Heidelberg (2000)
10. Wang, J., Lu, Y., Tzvetkov, P.: Tfp: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans. on Knowl. and Data Eng. 17(5), 652-664 (2005); Senior Member-Jiawei Han
11. Dong, G., Li, J.: Mining border descriptions of emerging patterns from dataset pairs. Knowl. Inf. Syst. 8(2), 178-202 (2005)
12. Fan, H., Ramamohanarao, K.: An efficient single-scan algorithm for mining essential jumping emerging patterns for classification. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 456-462. Springer, Heidelberg (2002)
13. Tzvetkov, P., Yan, X., Han, J.: Tsp: Mining top-k closed sequential patterns. Knowl. Inf. Syst. 7(4), 438-457 (2005)
14. Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: VLDB, pp. 432-444 (1995)