Sirirut Vanichayobon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sirirut Vanichayobon has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Wiphada Wettayaprasit
Prince of Songkla University
4 shared publications - Ladda Preechaveerakul
Prince Songkla Univ, Fac Sci, Dept Comp Sci, Informat Syst Technol & Appl Res Lab iStar, Hat Yai, Thailand
3 shared publications John K. Antonio
Univ. of Oklahoma (USA)
2 shared publications- Naphat Keawpibal
Faculty of Science and Digital Innovation, Thaksin University, Phatthalung, 93210, Thailand; Research Center for Indigenous Plant Species in ASEAN Culture, Thaksin University, Phatthalung, 93210, Thailand
2 shared publications S. Lakshmivarahan
School of Computer Science, University of Oklahoma, Norman, OK 73019-6151, USA
2 shared publicationsSudarshan K. Dhall
Univ. of Oklahoma (USA)
2 shared publications
Latest Publications
- Open Access
- 22 March 2019
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 27 (2) , 1504-1522
HyBiX: A novel encoding bitmap index for space- and time-efficient query processing
A bitmap-based index is an effective and efficient indexing method for answering selective queries in a read- only environment. It offers improved query execution time by applying low-cost Boolean operators on the index directly, before accessing raw data. A drawback of the bitmap index is that index size increases with the cardinality of indexed attributes, which additionally has an impact on a query execution time. This impact is related to an increase of query execution time due to the scanning of bitmap vectors to answer the queries. In this paper, we propose a new encoding bitmap index, called the HyBiX bitmap index. The HyBiX bitmap index was experimentally compared to existing encoding bitmap indexes in terms of space requirement, query execution time, and space and time trade-off for equality and range queries. As experimental results, the HyBiX bitmap index can reduce space requirements with high cardinality attributes with satisfactory execution times for both equality and range queries. The performance of the HyBiX bitmap index provides the second-best results for equality queries and the first-best for range queries in terms of space and time trade-off.
- 22 March 2019
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 27 (2) , 1504-1522
Open AccessHyBiX: A novel encoding bitmap index for space- and time-efficient query processing
A bitmap-based index is an effective and efficient indexing method for answering selective queries in a read- only environment. It offers improved query execution time by applying low-cost Boolean operators on the index directly, before accessing raw data. A drawback of the bitmap index is that index size increases with the cardinality of indexed attributes, which additionally has an impact on a query execution time. This impact is related to an increase of query execution time due to the scanning of bitmap vectors to answer the queries. In this paper, we propose a new encoding bitmap index, called the HyBiX bitmap index. The HyBiX bitmap index was experimentally compared to existing encoding bitmap indexes in terms of space requirement, query execution time, and space and time trade-off for equality and range queries. As experimental results, the HyBiX bitmap index can reduce space requirements with high cardinality attributes with satisfactory execution times for both equality and range queries. The performance of the HyBiX bitmap index provides the second-best results for equality queries and the first-best for range queries in terms of space and time trade-off.
- Open Access
- 29 November 2018
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 26 (6) , 2803-2819
Human Sleep Scoring Based on K-Nearest Neighbors
- 29 November 2018
- Published by The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS in Turkish Journal of Electrical Engineering and Computer Sciences
- Vol. 26 (6) , 2803-2819
Open AccessHuman Sleep Scoring Based on K-Nearest Neighbors
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. iii, 1-6
Evaluate different machine learning techniques for classifying sleep stages on single-channel EEG
In this paper, we propose 3 different machine learning techniques such as Random Forest, Bagging and Support Vector Machine along with time domain feature for classifying sleep stages based on single-channel EEG. Whole-night polysomnograms from 25 subjects were recorded employing R&K standard. The evolved process investigated the EEG signals of (C4-A1) for sleep staging. Automatic and manual scoring results were associated on an epoch-by-epoch basis. An entire 96,000 data samples 30s sleep EEG epoch were calculated and applied for performance evaluation. The epoch-by-epoch assessment was created by classifying the EEG epochs into six stages (W/S1/S2/S3/S4/REM) according to proposed method and manual scoring. Result shows that Random Forest classifiers achieve the overall accuracy; specificity and sensitivity level of 97.73%, 96.3% and 99.51% respectively.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. iii, 1-6
Evaluate different machine learning techniques for classifying sleep stages on single-channel EEG
In this paper, we propose 3 different machine learning techniques such as Random Forest, Bagging and Support Vector Machine along with time domain feature for classifying sleep stages based on single-channel EEG. Whole-night polysomnograms from 25 subjects were recorded employing R&K standard. The evolved process investigated the EEG signals of (C4-A1) for sleep staging. Automatic and manual scoring results were associated on an epoch-by-epoch basis. An entire 96,000 data samples 30s sleep EEG epoch were calculated and applied for performance evaluation. The epoch-by-epoch assessment was created by classifying the EEG epochs into six stages (W/S1/S2/S3/S4/REM) according to proposed method and manual scoring. Result shows that Random Forest classifiers achieve the overall accuracy; specificity and sensitivity level of 97.73%, 96.3% and 99.51% respectively.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 309-314
DistEQ: Distributed equality query processing on Encoded Bitmap Index
With the next generation of data, called Big Data, an amount of data has grown rapidly, not only size but also variety and the speed of changing contents in its. The difficulties in Big Data are handling to store and process a large amount of data in real-time. Bitmap Indexes have widely known method to improve processing time. The advantage of these indexes is utilization of low-cost Boolean operations on the index before accessing to raw data. In this paper, we proposed a distributed and parallel processing, called DistEQ, to improve equality query on Encoded Bitmap Index by using MapReduce framework. Our comparative study demonstrates that our proposed approach outperforms other existing Encoded bitmap indexing techniques for an equality query in term of scalability and space-time trade-off.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 309-314
DistEQ: Distributed equality query processing on Encoded Bitmap Index
With the next generation of data, called Big Data, an amount of data has grown rapidly, not only size but also variety and the speed of changing contents in its. The difficulties in Big Data are handling to store and process a large amount of data in real-time. Bitmap Indexes have widely known method to improve processing time. The advantage of these indexes is utilization of low-cost Boolean operations on the index before accessing to raw data. In this paper, we proposed a distributed and parallel processing, called DistEQ, to improve equality query on Encoded Bitmap Index by using MapReduce framework. Our comparative study demonstrates that our proposed approach outperforms other existing Encoded bitmap indexing techniques for an equality query in term of scalability and space-time trade-off.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 95-100
A novel discretization technique using Class Attribute Interval Average
Discretization algorithm is important for data mining preprocessing because it will help the user to easily understand the data, reduce the complexity of data, reduce processing time, and increase efficiency and accuracy of the data. This paper proposes the new discretization algorithm called Class Attribute Interval Average (CAIA). The algorithm uses 2D-quanta matrix table to calculate each of class individual interval's average and merge the best adjacent intervals to form the new interval. The experimental design uses four-UCI data sets (Iris, Breast Cancer, Heart Diseases, Glass) and four-classification algorithms (J48, RBF, MLP, NB). The comparisons of experimental result with the other six discretization algorithms (EW, EF, ChiMerge, IEM, CAIM, CACC) show that the proposed CAIA has the best mean rank for both of the accuracy and the number of intervals.
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 95-100
A novel discretization technique using Class Attribute Interval Average
Discretization algorithm is important for data mining preprocessing because it will help the user to easily understand the data, reduce the complexity of data, reduce processing time, and increase efficiency and accuracy of the data. This paper proposes the new discretization algorithm called Class Attribute Interval Average (CAIA). The algorithm uses 2D-quanta matrix table to calculate each of class individual interval's average and merge the best adjacent intervals to form the new interval. The experimental design uses four-UCI data sets (Iris, Breast Cancer, Heart Diseases, Glass) and four-classification algorithms (J48, RBF, MLP, NB). The comparisons of experimental result with the other six discretization algorithms (EW, EF, ChiMerge, IEM, CAIM, CACC) show that the proposed CAIA has the best mean rank for both of the accuracy and the number of intervals.
- 1 January 2012
- Published by IACSIT Press in International Journal of Engineering and Technology
- Vol. 4 (4) , 404-408
Comparative Classifiers for Software Quality Assessment
- 1 January 2012
- Published by IACSIT Press in International Journal of Engineering and Technology
- Vol. 4 (4) , 404-408
Comparative Classifiers for Software Quality Assessment
- 1 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
QBE: A Queriable Binary Encoding Index for XML document
Currently, data on the Internet is in the form XML documents since XML is the main standard for data exchange format. Therefore, the development of the indexing technique of XML to accurately access the data stored in the XML documents has become a hot topic. In the paper, we propose an efficient encoding indexing technique to save processing time. We apply Dual Bitmap index to encode each node of element and attribute as bit string and use start_offset and end_offset to access raw data. Our comparative study shows that the performance of the proposed technique is better than the technique presented earlier.
- 1 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
QBE: A Queriable Binary Encoding Index for XML document
Currently, data on the Internet is in the form XML documents since XML is the main standard for data exchange format. Therefore, the development of the indexing technique of XML to accurately access the data stored in the XML documents has become a hot topic. In the paper, we propose an efficient encoding indexing technique to save processing time. We apply Dual Bitmap index to encode each node of element and attribute as bit string and use start_offset and end_offset to access raw data. Our comparative study shows that the performance of the proposed technique is better than the technique presented earlier.
- 1 April 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 32, 140-144
FIAST: A Novel Algorithm for Mining Frequent Itemsets
An efficient algorithm to mine frequent item sets is crucial for mining association rules. Most of the previously used algorithms have generally been developed for using the computational time effectively, reducing the number of candidate itemsets and decreasing the number of scan in the database. However, the time can be reduced by aggregate transactions having similar itemsets. This paper, then proposes an efficient algorithm for mining frequent item sets without generating candidate itemsets called FIAST (frequent itemsets algorithm for similar transactions). The algorithm uses a divide-and-conquer method to reduce the task into the bitwise AND operation for finding itemsets and uses a depth-first search strategy to generate all frequent itemsets. The time complexity is analyzed by mathematical proof.
- 1 April 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 32, 140-144
FIAST: A Novel Algorithm for Mining Frequent Itemsets
An efficient algorithm to mine frequent item sets is crucial for mining association rules. Most of the previously used algorithms have generally been developed for using the computational time effectively, reducing the number of candidate itemsets and decreasing the number of scan in the database. However, the time can be reduced by aggregate transactions having similar itemsets. This paper, then proposes an efficient algorithm for mining frequent item sets without generating candidate itemsets called FIAST (frequent itemsets algorithm for similar transactions). The algorithm uses a divide-and-conquer method to reduce the task into the bitwise AND operation for finding itemsets and uses a depth-first search strategy to generate all frequent itemsets. The time complexity is analyzed by mathematical proof.
- 1 March 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 174-178
Using Data Clustering to Optimize Scatter Bitmap Index for Membership Queries
Decision support systems that retrieve information from a data warehouse environment are usually designed to process complex and ad hoc queries. Indexing techniques based on bitmap representations can be used to improve the efficiency of information retrieval. Scatter Bitmap Index uses less space and is more CPU-efficient than other bitmap indexing techniques. It is simple to represent, and improves query processing time by utilizing low-cost Boolean operations and multiple index scans. The Scatter Bitmap Index technique performs simple predicate conditions on the index level before going to the primary data source. Furthermore, Scatter Bitmap Index can be optimized by applying K-mode Clustering, which finds relationships among attribute values in queries. In this paper, we show that Data Clustering with Scatter Bitmap Index can improve query processing time for membership queries.
- 1 March 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 174-178
Using Data Clustering to Optimize Scatter Bitmap Index for Membership Queries
Decision support systems that retrieve information from a data warehouse environment are usually designed to process complex and ad hoc queries. Indexing techniques based on bitmap representations can be used to improve the efficiency of information retrieval. Scatter Bitmap Index uses less space and is more CPU-efficient than other bitmap indexing techniques. It is simple to represent, and improves query processing time by utilizing low-cost Boolean operations and multiple index scans. The Scatter Bitmap Index technique performs simple predicate conditions on the index level before going to the primary data source. Furthermore, Scatter Bitmap Index can be optimized by applying K-mode Clustering, which finds relationships among attribute values in queries. In this paper, we show that Data Clustering with Scatter Bitmap Index can improve query processing time for membership queries.
- 1 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 318-322
The TF-IDF and Neural Networks Approach for Translation Initiation Site Prediction
The precise prediction of translation initiation site is an important task for the analysis of genomic sequence. This study aims to increase the accuracy for the prediction of translation initiation site using a TF-IDF-NN-TIS model (TF-IDF and neural networks approach for translation initiation site prediction). This study creates feature using 1-gram and 2-gram techniques for both upstream and downstream. Determining feature value uses TF-IDF approach and feature selection by correlation-based feature selection method. Evaluation prediction results use 10-fold cross validation. This study performed experiments on three different datasets that are Vertebrate, Arabidopsis thaliana, and TIS+50. The results of the study indicate that the proposed model gives highest accuracy with less processing time.
- 1 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 318-322
The TF-IDF and Neural Networks Approach for Translation Initiation Site Prediction
The precise prediction of translation initiation site is an important task for the analysis of genomic sequence. This study aims to increase the accuracy for the prediction of translation initiation site using a TF-IDF-NN-TIS model (TF-IDF and neural networks approach for translation initiation site prediction). This study creates feature using 1-gram and 2-gram techniques for both upstream and downstream. Determining feature value uses TF-IDF approach and feature selection by correlation-based feature selection method. Evaluation prediction results use 10-fold cross validation. This study performed experiments on three different datasets that are Vertebrate, Arabidopsis thaliana, and TIS+50. The results of the study indicate that the proposed model gives highest accuracy with less processing time.