![](https://dblp.uni-trier.de/img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Cheng-Ru Lin
Person information
SPARQL queries ![](https://dblp.uni-trier.de/img/new.blue.24x12.png)
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j7]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
- [j6]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) - [j5]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) - [j4]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) - 2004
- [j3]Xin-Mao Huang, Cheng-Ru Lin, Ming-Syan Chen
:
Design and performance study of rate staggering storage for scalable video in a disk-array-based video server. IEEE Trans. Consumer Electron. 50(4): 1119-1129 (2004) - 2003
- [j2]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) - [c6]Bi-Ru Dai, Cheng-Ru Lin, Ming-Syan Chen:
On the Techniques for Data Clustering with Numerical Constraints. SDM 2003: 264-268 - 2002
- [j1]Cheng-Ru Lin, Ming-Syan Chen
:
On the Asymptotical Optimality of Multilayered Decentralized Consensus Protocol. IEEE Trans. Parallel Distributed Syst. 13(8): 769-786 (2002) - [c5]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 - [c4]Cheng-Ru Lin, Ming-Syan Chen:
A robust and efficient clustering algorithm based on cohesion self-merging. KDD 2002: 582-587 - [c3]Cheng-Ru Lin, Ming-Syan Chen:
On the Optimal Clustering of Sequential Data. SDM 2002: 141-157 - 2001
- [c2]Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen:
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining. CIKM 2001: 263-270 - [c1]Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen:
On Mining General Temporal Association Rules in a Publication Database. ICDM 2001: 337-344
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint