메뉴 건너뛰기




Volumn , Issue , 2005, Pages 721-724

Mining approximate frequent itemsets from noisy data

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; ERROR ANALYSIS; MATHEMATICAL MODELS; PATTERN MATCHING; SYSTEMATIC ERRORS;

EID: 33746082673     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.93     Document Type: Conference Paper
Times cited : (21)

References (11)
  • 2
    • 34548558239 scopus 로고    scopus 로고
    • R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A Verkamo. Fast discovery of association rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discove and Data Mining, chapter 12, pages 307328. AAAI Pre 1996.
    • R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A Verkamo. Fast discovery of association rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discove and Data Mining, chapter 12, pages 307328. AAAI Pre 1996.
  • 3
    • 34548568494 scopus 로고    scopus 로고
    • C. Becquet , S. Blachon, B. Jeudy, J.F. Boulicaut, Gandrillon O. Strong-association-rule mining for large-scale gene-expression data analysis: a case study on humaMining gene expression databases for association rules, n SAGE data. Genome Biol. 2002
    • C. Becquet , S. Blachon, B. Jeudy, J.F. Boulicaut, Gandrillon O. Strong-association-rule mining for large-scale gene-expression data analysis: a case study on humaMining gene expression databases for association rules, n SAGE data. Genome Biol. 2002
  • 4
    • 0037245822 scopus 로고    scopus 로고
    • Mining gene expression databases for association rules
    • Jan;
    • C. Creighton, S. Hanash .Mining gene expression databases for association rules. Bioinformatics. 2003 Jan;19(1):79-86.
    • (2003) Bioinformatics , vol.19 , Issue.1 , pp. 79-86
    • Creighton, C.1    Hanash, S.2
  • 5
    • 33745450363 scopus 로고    scopus 로고
    • Mining Approximate Frequent Itemset from Noisy Data
    • Technical Report(TR.05-015) of Department of Compuater Science, UNC-Chapel Hill, Jun
    • J. Liu, S. Paulsen, W. Wang, A. Nobel, J. Prins. "Mining Approximate Frequent Itemset from Noisy Data". Technical Report(TR.05-015) of Department of Compuater Science, UNC-Chapel Hill, 2005 Jun.
    • (2005)
    • Liu, J.1    Paulsen, S.2    Wang, W.3    Nobel, A.4    Prins, J.5
  • 6
    • 84944079533 scopus 로고    scopus 로고
    • Comparative Study of Sequential Pattern Mining Models, Studies in Computational
    • Aug
    • H.C. Kum, S. Paulsen, W. Wang, Comparative Study of Sequential Pattern Mining Models, Studies in Computational Intelligence, Volume 6, Aug 2005, Pages 43-70.
    • (2005) Intelligence , vol.6 , pp. 43-70
    • Kum, H.C.1    Paulsen, S.2    Wang, W.3
  • 9
    • 12244289922 scopus 로고    scopus 로고
    • Support envelopes: A technique for exploring the structure of association patterns
    • M. Steinbach, P. N. Tan, V. Kumar. Support envelopes: a technique for exploring the structure of association patterns. In SIGKDD 2004.
    • (2004) SIGKDD
    • Steinbach, M.1    Tan, P.N.2    Kumar, V.3
  • 10
    • 0035672170 scopus 로고    scopus 로고
    • Biogeography of Australian freshwater ashes
    • Blackwell Science Ltd
    • P. J. Unmack. Biogeography of Australian freshwater ashes. Journal of Biogeography. Vol. 28: pages 1053-1089. Blackwell Science Ltd. 2001.
    • (2001) Journal of Biogeography , vol.28 , pp. 1053-1089
    • Unmack, P.J.1
  • 11
    • 0035789315 scopus 로고    scopus 로고
    • Efficient discovery of error-tolerant frequent itemsets in high dimensions
    • C. Yang, U. Fayyad, P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In SIGKDD 2001.
    • (2001) SIGKDD
    • Yang, C.1    Fayyad, U.2    Bradley, P.S.3


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