| 
| |  | |  |
Fast Algorithms for Projected Clustering
Note: Links lead to the DBLP on the Web.
Jong Soo Park
10
Charu C. Aggarwal
,
Cecilia Magdalena Procopiuc
,
Joel L. Wolf
,
Philip S. Yu
, Jong Soo Park: Fast Algorithms for Projected Clustering.
SIGMOD Conference 1999
: 61-72
9
Ming-Syan Chen
, Jong Soo Park,
Philip S. Yu
: Efficient Data Mining for Path Traversal Patterns.
TKDE 10
(2): 209-221 (1998)
8
Jong Soo Park,
Philip S. Yu
,
Ming-Syan Chen
: Mining Association Rules with Adjustable Accuracy.
CIKM 1997
: 151-160
7
Jong Soo Park,
Ming-Syan Chen
,
Philip S. Yu
: Using a Hash-Based Method with Transaction Trimming for Mining Association Rules.
TKDE 9
(5): 813-825 (1997)
6
Ming-Syan Chen
, Jong Soo Park,
Philip S. Yu
: Efficient Data Mining for Path Traversal Patterns in Distributed Systems.
ICDCS 1996
: 385-393
5
Jong Soo Park,
Ming-Syan Chen
,
Philip S. Yu
: Efficient Parallel and Data Mining for Association Rules.
CIKM 1995
: 31-36
4
Jong Soo Park,
Ming-Syan Chen
,
Philip S. Yu
: An Effective Hash Based Algorithm for Mining Association Rules.
SIGMOD Conference 1995
: 175-186
3
Ho Chang
, Jong Soo Park,
Myunghwan Kim
: Select-partitioned join: an improved pratition-based join algorithm.
IS 16
(2): 199-209 (1991)
2
Jae Moon Lee
, Jong Soo Park,
Myunghwan Kim
: An Upper Bound on Buffer Size for Join Operation Using Nonclusterd Indexes.
IPL 36
(2): 85-90 (1990)
1
Jong Soo Park,
Myunghwan Kim
: A Selection Algorithm with a Practical Upper Bound on Expected Number.
SP&E 19
(11): 1105-1110 (1989)
Copyright(C) 2000 ACM | | | | | | |
