default search action
Komate Amphawan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Sumet Darapisut, Komate Amphawan, Nutthanon Leelathakul
, Sunisa Rimcharoen
A Hybrid POI Recommendation System Combining Link Analysis and Collaborative Filtering Based on Various Visiting Behaviors. ISPRS Int. J. Geo Inf. 12(10): 431 (2023) - 2020
- [c13]Benchamawan Chaisoongnoen, Komate Amphawan:
An improvement of supplementary book suggestion system. SMA 2020: 396-398 - [c12]Benchamawan Chaisoongnoen, Komate Amphawan:
Automatic Rap Lyrics Generation with Rhymes through Korean Syllables. SMA 2020: 399-401 - [c11]Sumet Darapisut, Komate Amphawan, Sunisa Rimcharoen, Nutthanon Leelathakul:
NILR: N-Most Interesting Location-based Recommender System. SMA 2020: 402-404
2010 – 2019
- 2018
- [c10]Kittipa Klangwisan, Komate Amphawan:
Efficient weighted-frequent-regular itemsets mining using interval word segments structure. KST 2018: 59-67 - 2017
- [c9]Kittipa Klangwisan, Komate Amphawan:
Mining weighted-frequent-regular itemsets from transactional database. KST 2017: 66-71 - [c8]Supachai Laoviboon, Komate Amphawan:
Mining high-utility itemsets with irregular occurrence. KST 2017: 89-94 - [c7]Sumalee Eisariyodom, Komate Amphawan:
Discovering interesting itemsets based on change in regularity of occurrence. KST 2017: 138-143 - 2015
- [j3]Komate Amphawan, Philippe Lenca:
Mining top-k frequent-regular closed patterns. Expert Syst. Appl. 42(21): 7882-7894 (2015) - 2014
- [c6]Sorapol Chompaisal, Komate Amphawan, Athasit Surarerks:
Mining N-most Interesting Multi-level Frequent Itemsets without Support Threshold. IC2IT 2014: 125-134 - 2013
- [c5]Komate Amphawan:
SST: An Efficient Suffix-Sharing Trie Structure for Dictionary Lookup. Asia International Conference on Modelling and Simulation 2013: 179-184 - [c4]Komate Amphawan, Philippe Lenca:
Mining Top-k Frequent/Regular Patterns Based on User-Given Trade-Off between Frequency and Regularity. IAIT 2013: 1-12 - 2012
- [j2]Komate Amphawan, Philippe Lenca, Athasit Surarerks:
Mining top-k regular-frequent itemsets using database partitioning and support estimation. Expert Syst. Appl. 39(2): 1924-1936 (2012) - [j1]Komate Amphawan, Philippe Lenca, Athasit Surarerks:
Erratum to "Mining top-k regular-frequent itemsets using database partitioning and support estimation" [Expert Systems with Applications 39 (2) (2011) 1924-1936]. Expert Syst. Appl. 39(6): 6275 (2012) - 2011
- [c3]Komate Amphawan, Philippe Lenca, Athasit Surarerks:
Efficient Mining Top-k Regular-Frequent Itemset Using Compressed Tidsets. PAKDD Workshops 2011: 124-135 - 2010
- [c2]Komate Amphawan, Athasit Surarerks, Philippe Lenca:
Mining Periodic-Frequent Itemsets with Approximate Periodicity Using Interval Transaction-Ids List Tree. WKDD 2010: 245-248
2000 – 2009
- 2009
- [c1]Komate Amphawan, Philippe Lenca, Athasit Surarerks:
Mining Top-K Periodic-Frequent Pattern from Transactional Databases without Support Threshold. IAIT 2009: 18-29
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-04-25 05:57 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: