Salin Boonbrahm
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Salin Boonbrahm has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Charlee Kaewrat
Informatics Innovation Center of Excellence (IICE), School of Informatics, Walailak University, Nakhon Si Thammarat 80160, Thailand
1 shared publication - Chuleerat Jaruskulchai
Department of Computer Science, Kasetsart University, Bangkok, Thailand
1 shared publication - Lanjakorn Sewata
Walailak University
1 shared publication - Patiwat Katelertprasert
School of Informatics, Walailak University, Nakhon Si Thammarat 80160, Thailand
1 shared publication - Poonpong Boonbrahm
Walailak University
1 shared publication Thaweesak Khongtuk
1 shared publication
Latest Publications
- 27 September 2018
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2016 (1) , 020067
MapDiff-FI : Map different sets for frequent itemsets mining
Mining frequent sets is one of the fundamental methods from the prospering field of data mining that describe relationships between items in data sets. The size of data sets required for discovery frequent itemsets plays an important role. In recent years, some data structure based on different sets have been proposed, which have shown to be efficient and scalable for mining frequent itemsets. In this paper, we propose Map Different Sets (MapDiff), a novel and more efficient itemset representation, for mining frequent itemsets. For evaluating the performance of MapDiff, we have conducted extensive experiments to compare it with original data sets on a variety of real datasets and synthetic datasets from UCI and IBM. The experimental results showed that MapDiff structure can be reduce the size of datasets with keep all information of original data.
- 27 September 2018
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2016 (1) , 020067
MapDiff-FI : Map different sets for frequent itemsets mining
Mining frequent sets is one of the fundamental methods from the prospering field of data mining that describe relationships between items in data sets. The size of data sets required for discovery frequent itemsets plays an important role. In recent years, some data structure based on different sets have been proposed, which have shown to be efficient and scalable for mining frequent itemsets. In this paper, we propose Map Different Sets (MapDiff), a novel and more efficient itemset representation, for mining frequent itemsets. For evaluating the performance of MapDiff, we have conducted extensive experiments to compare it with original data sets on a variety of real datasets and synthetic datasets from UCI and IBM. The experimental results showed that MapDiff structure can be reduce the size of datasets with keep all information of original data.
- 21 July 2015
- Published by Springer Nature
- p. 162-171
3D Real Time Virtual Fitting Room for Women