default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThu-Lan Dam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j10]Thu-Lan Dam, Sean Chester
, Kjetil Nørvåg, Quang-Huy Duong:
Efficient top-k recently-frequent term querying over spatio-temporal textual streams. Inf. Syst. 97: 101687 (2021)- [j9]Quang-Huy Duong, Heri Ramampiaro, Kjetil Nørvåg, Thu-Lan Dam:
Density Guarantee on Finding Multiple Subgraphs and Subtensors. ACM Trans. Knowl. Discov. Data 15(5): 76:1-76:32 (2021)
2010 – 2019
- 2019
- [j8]Thu-Lan Dam, Kenli Li, Philippe Fournier-Viger, Quang-Huy Duong:
CLS-Miner: efficient and effective closed high-utility itemset mining. Frontiers Comput. Sci. 13(2): 357-381 (2019) - [j7]Thu-Lan Dam, Heri Ramampiaro, Kjetil Nørvåg, Quang-Huy Duong:
Towards efficiently mining closed high utility itemsets from incremental databases. Knowl. Based Syst. 165: 13-29 (2019) - 2018
- [j6]Quang-Huy Duong, Philippe Fournier-Viger, Heri Ramampiaro, Kjetil Nørvåg, Thu-Lan Dam:
Efficient high utility itemset mining using buffered utility-lists. Appl. Intell. 48(7): 1859-1877 (2018) - [j5]Quang-Huy Duong, Heri Ramampiaro, Kjetil Nørvåg, Philippe Fournier-Viger, Thu-Lan Dam:
High utility drift detection in quantitative data streams. Knowl. Based Syst. 157: 34-51 (2018) - 2017
- [j4]Thu-Lan Dam, Kenli Li, Philippe Fournier-Viger, Quang-Huy Duong:
An efficient algorithm for mining top-k on-shelf high utility itemsets. Knowl. Inf. Syst. 52(3): 621-655 (2017) - [j3]Thu-Lan Dam, Kenli Li, Philippe Fournier-Viger:
Chemical reaction optimization with unified tabu search for the vehicle routing problem. Soft Comput. 21(21): 6421-6433 (2017) - 2016
- [j2]Thu-Lan Dam, Kenli Li, Philippe Fournier-Viger, Quang-Huy Duong:
An efficient algorithm for mining top-rank-k frequent patterns. Appl. Intell. 45(1): 96-111 (2016) - [j1]Quang-Huy Duong, Bo Liao, Philippe Fournier-Viger, Thu-Lan Dam:
An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowl. Based Syst. 104: 106-122 (2016) - [c2]Philippe Fournier-Viger, Jerry Chun-Wei Lin, Quang-Huy Duong, Thu-Lan Dam:
FHM + : Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction. IEA/AIE 2016: 115-127 - [c1]Philippe Fournier-Viger, Jerry Chun-Wei Lin, Quang-Huy Duong, Thu-Lan Dam:
PHM: Mining Periodic High-Utility Itemsets. ICDM 2016: 64-79
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-07 22:14 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:
