SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

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

Volumn 3177, Issue , 2004, Pages 352-358

PRICES: An efficient algorithm for mining association rules

(2) Wang, Chuan a Tjortjis, Christos a

a UNIVERSITY OF MANCHESTER (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048903701 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-28651-6_52 Document Type: Article

Times cited : (21)

References (9)

1
- 0027621699
- Mining Association Rules between Sets of Items in Large Databases
- Washington, D.C., May
- R. Agrawal, T. Imielinski, and A.N. Swami. Mining Association Rules between Sets of Items in Large Databases. Proceedings of the 1993 ACM SIGMOD Int'l Conf. Management of Data, pp. 207-216, Washington, D.C., May 1993.
- (1993) Proceedings of the 1993 ACM SIGMOD Int'l Conf. Management of Data , pp. 207-216
- Agrawal, R.¹ Imielinski, T.² Swami, A.N.³

2
- 0001882616
- Fast Algorithms for Mining Association Rules in Large Databases
- September
- R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. Proc. 20th Int'l Conf. Very Large Data Bases, September 1994.
- (1994) Proc. 20th Int'l Conf. Very Large Data Bases
- Agrawal, R.¹ Srikant, R.²

3
- 35048887546
- Experiences of Using a Quantitative Approach for Mining Association Rules
- th Int'l Conf. Intelligent Data Engineering Automated Learning (IDEAL 03)
- th Int'l Conf. Intelligent Data Engineering Automated Learning (IDEAL 03) in Lecture Notes in Computer Science Series Vol. 2690, pp. 693-700
- Lecture Notes in Computer Science Series , vol.2690 , pp. 693-700
- Dong, L.¹ Tjortjis, C.²

4
- 0029224819
- Set-Oriented Mining for Association Rules in Relational Databases
- Taipei,Taiwan,March
- M. Houtsma and A. Swami. Set-Oriented Mining for Association Rules in Relational Databases, Proc. 11th IEEE Int'l Conf. Data Engineering, pp. 25-34,Taipei,Taiwan,March, 1995.
- (1995) Proc. 11th IEEE Int'l Conf. Data Engineering , pp. 25-34
- Houtsma, M.¹ Swami, A.²

5
- 0031220368
- Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
- September/October
- J.S. Park, M.S. Chen and P.S. Yu. Using a Hash-Based Method with Transaction Trimming For Mining Association Rules. IEEE Transactions on Knowledge and Data Engineering, September/October 1997.
- (1997) IEEE Transactions on Knowledge and Data Engineering
- Park, J.S.¹ Chen, M.S.² Yu, P.S.³

6
- 35048831054
- An Efficient Algorithm for Mining Association Rules in Large Databases
- SIGMOD 1998, June 2-4, Seattle, Washington, USA
- A. Savasere, E. Omiecinski, and S.B. Navathe. An Efficient Algorithm for Mining Association Rules in Large Databases, Proc. ACM SIGMOD Int'l Conf. Management of Data, SIGMOD 1998, June 2-4, 1998, Seattle, Washington, USA.
- (1998) Proc. ACM SIGMOD Int'l Conf. Management of Data
- Savasere, A.¹ Omiecinski, E.² Navathe, S.B.³

7
- 0002663969
- Sampling Large Databases for Association Rules
- Mumbai, India
- H. Toivonen. Sampling Large Databases for Association Rules, Proc. 22nd Int'l Conf. Very Large Databases, pp. 134-145, Mumbai, India, 1996.
- (1996) Proc. 22nd Int'l Conf. Very Large Databases , pp. 134-145
- Toivonen, H.¹

8
- 35048834471
- www.cs.waikato.ac.nz/-ml/weka. Weka Experiment Environment, Weka Data Mining System. (Last accessed in March, 2004).
- Weka Experiment Environment, Weka Data Mining System

9
- 84858885580
- IBM Almadeń Research Center
- http://www.almaden.ibm.com/software/quest/. Intelligent Information Systems, IBM Almadeń Research Center. (Last accessed in January, 2004).
- Intelligent Information Systems

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