default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuanling Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[e1]Sheng-Lung Peng, Guanling Lee, Reinhard Klette, Ching-Hsien Hsu:
Internet of Vehicles. Technologies and Services for Smart Cities - 4th International Conference, IOV 2017, Kanazawa, Japan, November 22-25, 2017, Proceedings. Lecture Notes in Computer Science 10689, Springer 2017, ISBN 978-3-319-72328-0 [contents]- 2016
- [j18]Hsin-Chang Lin, Guanling Lee:
Speedily, efficient and adaptive streaming algorithms for real-time detection of flooding attacks. J. Intell. Fuzzy Syst. 31(4): 2363-2373 (2016) - 2015
- [j17]Chih-Chieh Tseng, Guanling Lee:
A Depth-First Search Approach for Mining Proportional Fault-Tolerant Frequent Patterns Efficiently in Large Database. J. Comput. 10(6): 388-395 (2015) - [j16]Yi-Chun Chen, Guanling Lee:
Mining Non-Redundant Substitution Rules between Sets of Items in Large Databases. J. Inf. Sci. Eng. 31(2): 659-674 (2015) - [j15]Chia-Hung Yeh, Guanling Lee, Chih-Yang Lin
:
Robust Laser Speckle Authentication System Through Data Mining Techniques. IEEE Trans. Ind. Informatics 11(2): 505-512 (2015) - [c22]Guanling Lee, Hsiou-Hao Lin:
An efficient skyline maintenance method for data modification. FSKD 2015: 2486-2491 - [c21]Hsin-Chang Lin, Guanling Lee:
Building a Secure Cross Platform Enterprise Service Mobile Apps Using HTML5. NBiS 2015: 162-166 - 2013
- [j14]Guanling Lee, Yi-Chun Chen, Kuo-Che Hung:
PTree: Mining Sequential Patterns Efficiently in Multiple Data Streams Environment. J. Inf. Sci. Eng. 29(6): 1151-1169 (2013) - [c20]Guanling Lee, Chia-Jung Chang, Sheng-Lung Peng:
Exploring Community Structures by Comparing Group Characteristics. EMC/HumanCom 2013: 143-148 - 2012
- [j13]Guanling Lee, Sheng-Lung Peng, Yi-Chun Chen, Jia-Sin Huang:
An efficient search mechanism for supporting partial filename queries in structured peer-to-peer overlay. Peer-to-Peer Netw. Appl. 5(4): 340-349 (2012) - [j12]Guanling Lee, Yi-Chun Chen:
Protecting Sensitive knowledge in association patterns mining. WIREs Data Mining Knowl. Discov. 2(1): 60-68 (2012) - [c19]Hao-Sen Chen, Guanling Lee, Sheng-Lung Peng:
On the gene team mining problem. FSKD 2012: 1124-1127 - [c18]Guanling Lee, Sheng-Lung Peng, Shih-Wei Kuo, Yi-Chun Chen:
Mining frequent maximal cliques efficiently by global view graph. FSKD 2012: 1362-1366 - 2011
- [c17]Guanling Lee, Yu-tang Zhu, Yi-Chun Chen:
Summarizing Association Itemsets by Pattern Interestingness in a Data Stream Environment. SUComS 2011: 74-83 - [c16]Guanling Lee, Yi-Chun Chen, Sheng-Lung Peng, Jyun-Hao Lin:
Solving the Sensitive Itemset Hiding Problem Whilst Minimizing Side Effects on a Sanitized Database. SUComS 2011: 104-113 - 2010
- [c15]Guanling Lee, Jia-Sin Huang, Yi-Chun Chen:
Supporting Filename Partial Matches in Structured Peer-to-Peer Overlay. GPC 2010: 101-108 - [c14]Yi-Chun Chen, Guanling Lee:
An efficient projected database method for mining sequential association rules. ICDIM 2010: 274-278
2000 – 2009
- 2009
- [j11]Guanling Lee, Sheng-Lung Peng, Yuh-Tzu Lin:
Proportional fault-tolerant data mining with applications to bioinformatics. Inf. Syst. Frontiers 11(4): 461-469 (2009) - [c13]Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng:
Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs. TAMC 2009: 158-167 - 2008
- [j10]En Tzu Wang, Guanling Lee:
An efficient sanitization algorithm for balancing information privacy and knowledge discovery in association patterns mining. Data Knowl. Eng. 65(3): 463-484 (2008) - [c12]Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng:
Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs. ICIC (2) 2008: 758-765 - [c11]Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee:
Mining fault-tolerant frequent patterns efficiently with powerful pruning. SAC 2008: 927-931 - 2007
- [c10]Guanling Lee, Qiao-Tzu Chen:
A single pass algorithm of finding frequent vibrated items over online data streams. ICDIM 2007: 206-211 - 2006
- [j9]Guanling Lee, Wenpo Yang, Jia-Min Lee:
A parallel algorithm for mining multiple partial periodic patterns. Inf. Sci. 176(24): 3591-3609 (2006) - [c9]Mei Li, Guanling Lee, Wang-Chien Lee, Anand Sivasubramaniam:
PENS: an algorithm for density-based clustering in peer-to-peer systems. Infoscale 2006: 39 - 2005
- [j8]Chih-Hao Hsu, Guanling Lee, Arbee L. P. Chen:
An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels. Distributed Parallel Databases 18(3): 207-222 (2005) - [j7]Guanling Lee, Yi-Ning Pan, Arbee L. P. Chen:
Data Scheduling in Multiple Channel/Multiple Receiver Environments for Processing Data Requests with Timing Constraints. J. Inf. Sci. Eng. 21(6): 1179-1199 (2005) - [c8]En Tzu Wang, Guanling Lee, Yu Tzu Lin:
A Novel Method for Protecting Sensitive Knowledge in Association Rules Mining. COMPSAC (1) 2005: 511-516 - 2004
- [j6]Shou-Chih Lo, Guanling Lee, Wen-Tsuen Chen, Jen-Chu Liu:
Architecture for mobility and QoS support in all-IP wireless networks. IEEE J. Sel. Areas Commun. 22(4): 691-705 (2004) - [c7]Guanling Lee, Chien-Yu Chang, Arbee L. P. Chen:
Hiding Sensitive Patterns in Association Rules Mining. COMPSAC 2004: 424-429 - [c6]Wenpo Yang, Guanling Lee:
Efficient Partial Multiple Periodic Patterns Mining without Redundant Rules. COMPSAC 2004: 430-435 - 2003
- [j5]Guanling Lee, Shou-Chih Lo:
Broadcast Data Allocation for Efficient Access of Multiple Data Items in Mobile Environments. Mob. Networks Appl. 8(4): 365-375 (2003) - [j4]Shou-Chih Lo, Guanling Lee, Wen-Tsuen Chen:
An Efficient Multipolling Mechanism for IEEE 802.11 Wireless LANs. IEEE Trans. Computers 52(6): 764-778 (2003) - 2002
- [j3]Guanling Lee, Shou-Chih Lo, Arbee L. P. Chen:
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing. IEEE Trans. Computers 51(10): 1237-1252 (2002) - [c5]Guanling Lee, Yi-Ning Pan, Arbee L. P. Chen:
Scheduling Real-Time Data Items In Multiple Channels And Multiple Receivers Environments. ICDCS 2002: 455-456 - [c4]Guanling Lee, Meng-Shin Yeh, Shou-Chih Lo, Arbee L. P. Chen:
A Strategy for Efficient Access of Multiple Data Items in Mobile Environments. Mobile Data Management 2002: 71-78 - [c3]Chih-Hao Hsu, Guanling Lee, Arbee L. P. Chen:
Index and Data Allocation on Multiple Broadcast Channels Considering Data Access Frequencies. Mobile Data Management 2002: 87-93 - 2001
- [j2]Guanling Lee, K. L. Lee, Arbee L. P. Chen:
Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases. Knowl. Inf. Syst. 3(3): 338-355 (2001) - [j1]Guanling Lee, Arbee L. P. Chen:
The Design of Location Regions Using User Movement Behaviors in PCS Systems. Multim. Tools Appl. 15(2): 187-202 (2001) - [c2]Chih-Hao Hsu, Guanling Lee, Arbee L. P. Chen:
A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels. CIKM 2001: 303-309
1990 – 1999
- 1999
- [c1]K. L. Lee, Guanling Lee, Arbee L. P. Chen:
Efficient Graph-Based Algorithm for Discovering and Maintaining Knowledge in Large Databases. PAKDD 1999: 409-419
Coauthor Index
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-10-22 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
