 | 2007 |
|---|
| 12 |       | Bi-Ru Dai,
Cheng-Ru Lin,
Ming-Syan Chen:
Constrained data clustering by depth control and progressive constraint relaxation.
VLDB J. 16(2): 201-217 (2007) |
| 2005 |
|---|
| 11 | | Cheng-Ru Lin,
Ming-Syan Chen:
Combining Partitional and Hierarchical Algorithms for Robust and Efficient Data Clustering with Cohesion Self-Merging.
IEEE Trans. Knowl. Data Eng. 17(2): 145-159 (2005) |
| 10 | | Cheng-Ru Lin,
Ken-Hao Liu,
Ming-Syan Chen:
Dual Clustering: Integrating Data Clustering over Optimization and Constraint Domains.
IEEE Trans. Knowl. Data Eng. 17(5): 628-637 (2005) |
| 9 | | Chang-Hung Lee,
Cheng-Ru Lin,
Ming-Syan Chen:
Sliding window filtering: an efficient method for incremental mining on a time-variant database.
Inf. Syst. 30(3): 227-244 (2005) |
| 2003 |
|---|
| 8 | | Bi-Ru Dai,
Cheng-Ru Lin,
Ming-Syan Chen:
On the Techniques for Data Clustering with Numerical Constraints.
SDM 2003 |
| 7 | | Chang-Hung Lee,
Ming-Syan Chen,
Cheng-Ru Lin:
Progressive Partition Miner: An Efficient Algorithm for Mining General Temporal Association Rules.
IEEE Trans. Knowl. Data Eng. 15(4): 1004-1017 (2003) |
| 2002 |
|---|
| 6 | | Cheng-Ru Lin,
Chang-Hung Lee,
Ming-Syan Chen,
Philip S. Yu:
Distributed data mining in a chain store database of short transactions.
KDD 2002: 576-581 |
| 5 | | Cheng-Ru Lin,
Ming-Syan Chen:
A robust and efficient clustering algorithm based on cohesion self-merging.
KDD 2002: 582-587 |
| 4 | | Cheng-Ru Lin,
Ming-Syan Chen:
On the Optimal Clustering of Sequential Data.
SDM 2002 |
| 3 | | Cheng-Ru Lin,
Ming-Syan Chen:
On the Asymptotical Optimality of Multilayered Decentralized Consensus Protocol.
IEEE Trans. Parallel Distrib. Syst. 13(8): 769-786 (2002) |
| 2001 |
|---|
| 2 |  | Chang-Hung Lee,
Cheng-Ru Lin,
Ming-Syan Chen:
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining.
CIKM 2001: 263-270 |
| 1 | | Chang-Hung Lee,
Cheng-Ru Lin,
Ming-Syan Chen:
On Mining General Temporal Association Rules in a Publication Database.
ICDM 2001: 337-344 |
Data released under the ODC-BY 1.0 license — See also our legal information page