| 2009 |
|---|
| 11 | EE | Chowdhury Farhan Ahmed,
Syed Khairuzzaman Tanbeer,
Byeong-Soo Jeong,
Young-Koo Lee:
Mining high utility patterns in incremental databases.
ICUIMC 2009: 656-663 |
| 10 | EE | Syed Khairuzzaman Tanbeer,
Chowdhury Farhan Ahmed,
Byeong-Soo Jeong,
Young-Koo Lee:
Discovering Periodic-Frequent Patterns in Transactional Databases.
PAKDD 2009: 242-253 |
| 9 | EE | Chowdhury Farhan Ahmed,
Syed Khairuzzaman Tanbeer,
Byeong-Soo Jeong,
Young-Koo Lee:
An Efficient Candidate Pruning Technique for High Utility Pattern Mining.
PAKDD 2009: 749-756 |
| 8 | EE | Syed Khairuzzaman Tanbeer,
Chowdhury Farhan Ahmed,
Byeong-Soo Jeong,
Young-Koo Lee:
Efficient single-pass frequent pattern mining using a prefix-tree.
Inf. Sci. 179(5): 559-583 (2009) |
| 2008 |
|---|
| 7 | EE | Chowdhury Farhan Ahmed,
Syed Khairuzzaman Tanbeer,
Byeong-Soo Jeong,
Young-Koo Lee:
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns.
AusDM 2008: 79-86 |
| 6 | EE | Chowdhury Farhan Ahmed,
Syed Khairuzzaman Tanbeer,
Byeong-Soo Jeong,
Young-Koo Lee:
Efficient Single-Pass Mining of Weighted Interesting Patterns.
Australasian Conference on Artificial Intelligence 2008: 404-415 |
| 5 | EE | Syed Khairuzzaman Tanbeer,
Chowdhury Farhan Ahmed,
Byeong-Soo Jeong,
Young-Koo Lee:
Efficient frequent pattern mining over data streams.
CIKM 2008: 1447-1448 |
| 4 | EE | Syed Khairuzzaman Tanbeer,
Chowdhury Farhan Ahmed,
Byeong-Soo Jeong,
Young-Koo Lee:
RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database.
IDEAL 2008: 193-200 |
| 3 | EE | Chowdhury Farhan Ahmed,
Syed Khairuzzaman Tanbeer,
Byeong-Soo Jeong,
Young-Koo Lee:
Mining Weighted Frequent Patterns Using Adaptive Weights.
IDEAL 2008: 258-265 |
| 2 | EE | Syed Khairuzzaman Tanbeer,
Chowdhury Farhan Ahmed,
Byeong-Soo Jeong,
Young-Koo Lee:
CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining.
PAKDD 2008: 1022-1027 |
| 1 | EE | Chowdhury Farhan Ahmed,
Syed Khairuzzaman Tanbeer,
Byeong-Soo Jeong,
Young-Koo Lee:
Mining Weighted Frequent Patterns in Incremental Databases.
PRICAI 2008: 933-938 |
