![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![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
Chang-Hung Lee
Person information
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
2010 – 2019
- 2014
- [j5]Chang-Hung Lee
, Wen-Yu Chuang, Melissa A. Cowan, Wen-Jung Wu, Chih-Ting Lin
:
A Low-Power Integrated Humidity CMOS Sensor by Printing-on-Chip Technology. Sensors 14(5): 9247-9255 (2014) - [c11]Wen-Yu Chuang, Chang-Hung Lee
, Chih-Ting Lin
, Yu-Cheng Lien, Wen-Jong Wu:
Self-Sustain Wireless Sensor Module. iThings/GreenCom/CPSCom 2014: 288-291 - 2012
- [c10]Chang-Hung Lee
, Wen-Yu Chuang, Chih-Ting Lin
, Shih-Hui Lin, Wen-Jong Wu
:
The heterogeneous sensor system on chip. APCCAS 2012: 81-83
2000 – 2009
- 2008
- [j4]Jian Chih Ou, Chang-Hung Lee, Ming-Syan Chen
:
Efficient algorithms for incremental Web log mining with dynamic thresholds. VLDB J. 17(4): 827-845 (2008) - 2005
- [j3]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) - [c9]Jian Chih Ou, Chang-Hung Lee, Ming-Syan Chen
:
Web log mining with adaptive support thresholds. WWW (Special interest tracks and posters) 2005: 1188-1189 - 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) - [c8]Chang-Hung Lee, Jian Chih Ou, Ming-Syan Chen:
Progressive Weighted Miner: An Efficient Method for Time-Constraint Mining. PAKDD 2003: 449-460 - 2002
- [j1]Chang-Hung Lee, Ming-Syan Chen
:
Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins. IEEE Trans. Computers 51(10): 1182-1195 (2002) - [c7]Cheng-Yue Chang, Ming-Syan Chen, Chang-Hung Lee:
Mining General Temporal Association Rules for Items with Different Exhibition Periods. ICDM 2002: 59-66 - [c6]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 - [c5]Chang-Hung Lee, Philip S. Yu, Ming-Syan Chen:
Mining Relationship between Triggering and Consequential Events in a Short Transaction Database. SDM 2002: 403-419 - 2001
- [c4]Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen:
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining. CIKM 2001: 263-270 - [c3]Chang-Hung Lee, Ming-Syan Chen
:
Using Remote Joins for the Processing of Distributed Mobile Queries. DASFAA 2001: 226-233 - [c2]Chang-Hung Lee, Ming-Syan Chen:
Distributed Query Processing in the Internet: Exploring Relation Replication and Network Characteristics. ICDCS 2001: 439-446 - [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:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint