메뉴 건너뛰기




Volumn 29, Issue 10, 2008, Pages 1515-1523

Mining conditional patterns in a database

Author keywords

Association analysis; Conditional pattern; Synthesis of pattern

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; PATTERN RECOGNITION; PROBLEM SOLVING;

EID: 44449161278     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2008.03.005     Document Type: Article
Times cited : (20)

References (14)
  • 1
    • 72449169018 scopus 로고    scopus 로고
    • Adhikari, A., Rao, P.R., 2007. A framework for synthesizing arbitrary Boolean expressions induced by frequent itemsets. In: Proc. 3rd Indian Internat. Conf on Artificial Intelligence.
    • Adhikari, A., Rao, P.R., 2007. A framework for synthesizing arbitrary Boolean expressions induced by frequent itemsets. In: Proc. 3rd Indian Internat. Conf on Artificial Intelligence.
  • 2
    • 0027621699 scopus 로고    scopus 로고
    • Agrawal, R., Imielinski, T., Swami A., 1993. Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD Conf. on Management of Data, 1993, pp. 207-216.
    • Agrawal, R., Imielinski, T., Swami A., 1993. Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD Conf. on Management of Data, 1993, pp. 207-216.
  • 3
    • 44449126352 scopus 로고    scopus 로고
    • Agrawal, R., Srikant, R., 1994. Fast algorithms for mining association rules. In: Proc. Internat. Conf. on Very Large Data Bases, 1994, pp. 487-499.
    • Agrawal, R., Srikant, R., 1994. Fast algorithms for mining association rules. In: Proc. Internat. Conf. on Very Large Data Bases, 1994, pp. 487-499.
  • 4
    • 34247340013 scopus 로고    scopus 로고
    • Antonie, M.-L., Zai{dotless}̈ane, O.R., 2004. Mining positive and negative association rules: An approach for confined rules. In: Proc. PKDD, 2004, pp. 27-38.
    • Antonie, M.-L., Zai{dotless}̈ane, O.R., 2004. Mining positive and negative association rules: An approach for confined rules. In: Proc. PKDD, 2004, pp. 27-38.
  • 6
    • 44449090180 scopus 로고    scopus 로고
    • Frequent itemset mining dataset repository. .
    • Frequent itemset mining dataset repository. .
  • 7
    • 44449111937 scopus 로고    scopus 로고
    • FIMI, 2004. .
    • FIMI, 2004. .
  • 8
    • 0039253846 scopus 로고    scopus 로고
    • Han, J., Pei, J., Yiwen, Y., 2000. Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD Conf. on Management of Data, 2000, pp. 1-12.
    • Han, J., Pei, J., Yiwen, Y., 2000. Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD Conf. on Management of Data, 2000, pp. 1-12.
  • 9
    • 44449125887 scopus 로고    scopus 로고
    • Hilderman, R.J. Hamilton, H.J., 1999. Knowledge discovery and interestingness measures: A survey. Technical Report CS-99-04, Department of Computer Science, University of Regina, 1999.
    • Hilderman, R.J. Hamilton, H.J., 1999. Knowledge discovery and interestingness measures: A survey. Technical Report CS-99-04, Department of Computer Science, University of Regina, 1999.
  • 10
    • 0035198761 scopus 로고    scopus 로고
    • Advances in predictive models for data mining
    • Hong S.J., and Weiss S.M. Advances in predictive models for data mining. Pattern Recognition Lett. 22 1 (2001) 55-61
    • (2001) Pattern Recognition Lett. , vol.22 , Issue.1 , pp. 55-61
    • Hong, S.J.1    Weiss, S.M.2
  • 11
    • 44449087639 scopus 로고    scopus 로고
    • Savasere, A., Omiecinski, E., Navathe, S., 1995. An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21st International Conference on Very Large Data Bases, 1995, pp. 432-443.
    • Savasere, A., Omiecinski, E., Navathe, S., 1995. An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21st International Conference on Very Large Data Bases, 1995, pp. 432-443.
  • 12
    • 0242625291 scopus 로고    scopus 로고
    • Tan, P.-N., Kumar, V., Srivastava J., 2002. Selecting the right interestingness measure for association patterns. In: Proc. SIGKDD Conf., 2002, pp. 32-41.
    • Tan, P.-N., Kumar, V., Srivastava J., 2002. Selecting the right interestingness measure for association patterns. In: Proc. SIGKDD Conf., 2002, pp. 32-41.
  • 13
    • 33747892727 scopus 로고    scopus 로고
    • Partition based pattern synthesis technique with efficient algorithms for nearest neighbor classification
    • Viswanath P., Murty M.N., and Bhatnagar S. Partition based pattern synthesis technique with efficient algorithms for nearest neighbor classification. Pattern Recognition Lett. 27 14 (2006) 1714-1724
    • (2006) Pattern Recognition Lett. , vol.27 , Issue.14 , pp. 1714-1724
    • Viswanath, P.1    Murty, M.N.2    Bhatnagar, S.3
  • 14
    • 63449084514 scopus 로고    scopus 로고
    • Wu, X., Wu, Y., Wang, Y., Li, Y., 2005. Privacy-aware market basket data set generation: A feasible approach for inverse frequent set mining. In: Proc. SIAM Internat Conf. on Data Mining, 2005, pp. 103-114.
    • Wu, X., Wu, Y., Wang, Y., Li, Y., 2005. Privacy-aware market basket data set generation: A feasible approach for inverse frequent set mining. In: Proc. SIAM Internat Conf. on Data Mining, 2005, pp. 103-114.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.