default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHua-Fu Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j17]Shih-Chuan Chiu, Hua-Fu Li, Jiun-Long Huang, Hsin-Han You:
Incremental mining of closed inter-transaction itemsets over data stream sliding windows. J. Inf. Sci. 37(2): 208-220 (2011)- [j16]Hua-Fu Li:
MHUI-max: An efficient algorithm for discovering high-utility itemsets from data streams. J. Inf. Sci. 37(5): 532-545 (2011) - [j15]Hua-Fu Li, Hsin-Yun Huang, Suh-Yin Lee:
Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits. Knowl. Inf. Syst. 28(3): 495-522 (2011) - [j14]Hua-Fu Li:
MEMSA: mining emerging melody structures from music query data. Multim. Syst. 17(3): 237-245 (2011) - [c17]Hua-Fu Li, Hsuan-Sheng Chen:
Discovering emerging melody patterns from customer query data streams of music service. ICME 2011: 1-4
2000 – 2009
- 2009
- [j13]Hua-Fu Li, Suh-Yin Lee:
Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Syst. Appl. 36(2): 1466-1477 (2009) - [j12]Hua-Fu Li, Chin-Chuan Ho, Suh-Yin Lee:
Incremental updates of closed frequent itemsets over continuous data streams. Expert Syst. Appl. 36(2): 2451-2458 (2009) - [j11]Hua-Fu Li:
A sliding window method for finding top-k path traversal patterns over streaming Web click-sequences. Expert Syst. Appl. 36(3): 4382-4386 (2009) - [j10]Hua-Fu Li:
Interactive mining of top-K frequent closed itemsets from data streams. Expert Syst. Appl. 36(7): 10779-10788 (2009) - [j9]Hua-Fu Li:
Mining top-k maximal reference sequences from streaming web click-sequences with a damped sliding window. Expert Syst. Appl. 36(8): 11304-11311 (2009) - [j8]Hua-Fu Li, Suh-Yin Lee:
Mining Top-K Path Traversal Patterns over Streaming Web Click-Sequences. J. Inf. Sci. Eng. 25(4): 1121-1133 (2009) - [j7]Hua-Fu Li:
Pattern discovery and change detection of online music query streams. Multim. Tools Appl. 41(2): 287-304 (2009) - [c16]Shih-Chuan Chiu, Man-Kwan Shan, Jiun-Long Huang, Hua-Fu Li:
Mining polyphonic repeating patterns from music data using bit-string based approaches. ICME 2009: 1170-1173 - [p1]Hua-Fu Li:
Pattern Discovery and Change Detection of Online Music Query Streams. Handbook of Multimedia for Digital Entertainment and Arts 2009: 327-347 - 2008
- [j6]Hua-Fu Li, Suh-Yin Lee:
Approximate mining of maximal frequent itemsets in data streams with different window models. Expert Syst. Appl. 35(3): 781-789 (2008) - [j5]Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee:
DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Knowl. Inf. Syst. 17(1): 79-97 (2008) - [j4]Hua-Fu Li:
Mining top-k Hot Melody Structures over online music query streams. Pattern Recognit. Lett. 29(16): 2116-2121 (2008) - [c15]Hua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun Liu, Suh-Yin Lee:
Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams. ICDM 2008: 881-886 - [c14]Hua-Fu Li, Ming-Ho Hsiao, Hsuan-Sheng Chen:
Efficiently mining frequent patterns in recent music query streams. ICME 2008: 1269-1272 - 2006
- [j3]Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan:
DSM-PLW: Single-pass mining of path traversal patterns over streaming Web click-sequences. Comput. Networks 50(10): 1474-1487 (2006) - [c13]Hua-Fu Li, Chin-Chuan Ho, Fang-Fei Kuo, Suh-Yin Lee:
A New Algorithm for Maintaining Closed Frequent Itemsets in Data Streams by Incremental Updates. ICDM Workshops 2006: 672-676 - [c12]Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, Suh-Yin Lee:
Incremental Mining of Sequential Patterns over a Stream Sliding Window. ICDM Workshops 2006: 677-681 - [c11]Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee:
Detecting Changes in User-Centered Music Query Streams. ICME 2006: 1977-1980 - [c10]Hua-Fu Li, Chin-Chuan Ho, Man-Kwan Shan, Suh-Yin Lee:
Online Mining of Recent Music Query Streams. ICME 2006: 1985-1988 - [c9]Hua-Fu Li, Chin-Chuan Ho, Man-Kwan Shan, Suh-Yin Lee:
Efficient Maintenance and Mining of Frequent Itemsets over Online Data Streams with a Sliding Window. SMC 2006: 2672-2677 - [c8]Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee:
Online mining of frequent query trees over XML data streams. WWW 2006: 959-960 - 2005
- [j2]Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan:
Online Mining Changes of Items over Continuous Append-only and Dynamic Data Streams. J. Univers. Comput. Sci. 11(8): 1411-1425 (2005) - [j1]Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan:
Online mining maximal frequent structures in continuous landmark melody streams. Pattern Recognit. Lett. 26(11): 1658-1674 (2005) - [c7]Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan:
Online Mining (Recently) Maximal Frequent Itemsets over Data Streams. RIDE 2005: 11-18 - [c6]Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan:
DSM-TKP: Mining Top-K Path Traversal Patterns over Web Click-Streams. Web Intelligence 2005: 326-329 - 2004
- [c5]Hua-Fu Li, Suh-Yin Lee:
Single-Pass Algorithms for Mining Frequency Change Patterns with Limited Space in Evolving Append-Only and Dynamic Transaction Data Streams. EEE 2004: 215-222 - [c4]Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan:
Mining frequent closed structures in streaming melody sequences. ICME 2004: 2031-2034 - [c3]Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan:
On mining webclick streams for path traversal patterns. WWW (Alternate Track Papers & Posters) 2004: 404-405 - 2002
- [c2]Hua-Fu Li, Man-Kwan Shan:
PNP: mining of profile navigational patterns. Data Mining and Knowledge Discovery: Theory, Tools, and Technology 2002: 252-260 - [c1]Man-Kwan Shan, Hua-Fu Li:
Fast discovery of structural navigational patterns from web user traversals. Data Mining and Knowledge Discovery: Theory, Tools, and Technology 2002: 272-283
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-07-31 21:40 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:
