메뉴 건너뛰기




Volumn , Issue , 2002, Pages 354-361

Efficient progressive sampling for association rules

Author keywords

[No Author keywords available]

Indexed keywords


EID: 78149344572     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (72)

References (21)
  • 1
    • 0031605774 scopus 로고    scopus 로고
    • Active disks: Programming model, algorithms and evaluation
    • Anurag Acharya et al. Active disks: Programming model, algorithms and evaluation. In ASPLOS, 1998.
    • (1998) ASPLOS
    • Acharya, A.1
  • 2
    • 0031649139 scopus 로고    scopus 로고
    • Online generation of association rules
    • C. Aggarwal and P. Yu. Online generation of association rules. In ICDE, 1998.
    • (1998) ICDE
    • Aggarwal, C.1    Yu, P.2
  • 4
    • 0035007850 scopus 로고    scopus 로고
    • Mafia: A maximal frequent itemset algorithm for transactional databases
    • Doug Burdick, Manuel Calimlim, and J. E. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In ICDE, 2001.
    • (2001) ICDE
    • Burdick, D.1    Calimlim, M.2    Gehrke, J.E.3
  • 5
    • 84958526425 scopus 로고
    • Megainduction: A test flight
    • Jason Catlett. Megainduction: A test flight. In Machine Learning, pages 596-599, 1991.
    • (1991) Machine Learning , pp. 596-599
    • Catlett, J.1
  • 7
    • 0013150820 scopus 로고    scopus 로고
    • Similarity of attributes by external probes
    • G. Das, H. Mannila, and P. Ronkainen. Similarity of attributes by external probes. In KDD, 1998.
    • (1998) KDD
    • Das, G.1    Mannila, H.2    Ronkainen, P.3
  • 8
    • 0141659269 scopus 로고    scopus 로고
    • Scaling up a boosting-based learner via adaptive sampling
    • Carlos Domingo and Osamu Watanabe. Scaling up a boosting-based learner via adaptive sampling. In PAKDD, 2000.
    • (2000) PAKDD
    • Domingo, C.1    Watanabe, O.2
  • 9
    • 0039253846 scopus 로고    scopus 로고
    • Yiwen yin: Mining frequent patterns without candidate generation
    • J. Han and J. Pei. Yiwen yin: Mining frequent patterns without candidate generation. In SIGMOD, 2000.
    • (2000) SIGMOD
    • Han, J.1    Pei, J.2
  • 10
    • 78149346625 scopus 로고
    • Rigorous learning curve bounds from statistical mechanics
    • Haussler, Kearns, Seung, and Tishby. Rigorous learning curve bounds from statistical mechanics. In COLT, 1994.
    • (1994) COLT
    • Haussler1    Kearns2    Seung3    Tishby4
  • 11
    • 85049139321 scopus 로고    scopus 로고
    • Static versus dynamic sampling for data mining
    • George H. John and Pat Langley. Static versus dynamic sampling for data mining. In KDD, 1996.
    • (1996) KDD
    • John, G.H.1    Langley, P.2
  • 14
    • 0002515248 scopus 로고    scopus 로고
    • Efficient progressive sampling
    • Foster J. Provost, David Jensen, and Tim Oates. Efficient progressive sampling. In KDD, 1999.
    • (1999) KDD
    • Provost, F.J.1    Jensen, D.2    Oates, T.3
  • 15
    • 0141771188 scopus 로고    scopus 로고
    • A survey of methods for scaling up inductive algorithms
    • Foster J. Provost and Venkateswarlu Kolluri. A survey of methods for scaling up inductive algorithms. Data Mining and Knowledge Discovery, 3(2):131-169, 1999.
    • (1999) Data Mining and Knowledge Discovery , vol.3 , Issue.2 , pp. 131-169
    • Provost, F.J.1    Kolluri, V.2
  • 16
    • 0001846174 scopus 로고    scopus 로고
    • Active storage for large-scale data mining and multimedia
    • E. Riedel, G. Gibson, and C. Faloutsos. Active storage for large-scale data mining and multimedia. In VLDB, 1998.
    • (1998) VLDB
    • Riedel, E.1    Gibson, G.2    Faloutsos, C.3
  • 17
    • 0005810893 scopus 로고    scopus 로고
    • Turbo-charging vertical mining of large databases
    • Pradeep Shenoy et al. Turbo-charging vertical mining of large databases. In SIGMOD, pages 22-33, 2000.
    • (2000) SIGMOD , pp. 22-33
    • Shenoy, P.1
  • 18
    • 0002663969 scopus 로고    scopus 로고
    • Sampling large databases for association rules
    • H. Toivonen. Sampling large databases for association rules. In 22nd VLDB Conf., 1996.
    • 22nd VLDB Conf., 1996
    • Toivonen, H.1
  • 19
    • 0023315240 scopus 로고    scopus 로고
    • An efficient algorithm for sequential random sampling
    • March 87
    • J. S. Vitter. An efficient algorithm for sequential random sampling. In ACM Trans. Mathematical Software, volume 13(1), pages 58-67, March 87.
    • ACM Trans. Mathematical Software , vol.13 , Issue.1 , pp. 58-67
    • Vitter, J.S.1
  • 20
    • 0030645988 scopus 로고    scopus 로고
    • Evaluation of sampling for data mining of association rules
    • M. J. Zaki, S. Parthasarathy et al. Evaluation of sampling for data mining of association rules. In RIDE, 1997.
    • (1997) RIDE
    • Zaki, M.J.1    Parthasarathy, S.2


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