Veera Boonjing

Veera Boonjing

Auto-generated profile, based on publicly available information

Veera Boonjing

Department of Computer Engineering, Faculty of Engineering, King Mongkut's Institute of Technology Ladkrabang, Bangkok, 10520, Thailand

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2020 in Heliyon
Verified
Journal Article
Open access
JMJirapond Muangprathub
Jirapond Muangprathub
VBVeera Boonjing
Veera Boonjing
KCKosin Chamnongthai
Kosin Chamnongthai
The aim of this research was to develop a learning recommendation component in an intelligent tutoring system (ITS) that dynamically predicts and adapts to a learner's style. In order to develop a proper ITS, we present an improved knowledge base supporting adaptive learning, which can be achieved by a suitable knowledge construction. This process is illustrated by implementing a web-based online tutor system. In addition, our knowledge structure provides adaptive presentation and personalized learning with the proposed adaptive algorithm, to retrieve content according to individual learner characteristics. To demonstrate the proposed adaptive algorithm, pre-test and post-test were used to evaluate suggestion accuracy of the course in a class for adapting to a learner's style. In addition, pre- and post-testing were also used with students in a real teaching/learning environment to evaluate the performance of the proposed model. The results show that the proposed system can be used to help students or learners achieve improved learning.

1 July 2012
Verified
Conference Paper
Closed access
CNChayanan Nawapornanan
Chayanan Nawapornanan
VBVeera Boonjing
Veera Boonjing
This paper proposes a new efficient algorithm for mining share-frequent itemsets from BitTable knowledge - extracted once from a transaction database. The knowledge contains sufficient information for such a mining task and provides efficient interactive access. The algorithm finds all share-frequent itemsets by level-wise generating complete promising candidates from a BitTable using heuristics and testing for desired solutions. Simulation results reveal that the proposed algorithm perform significantly better than ShFSM and DCG both runtime and a number of generated candidates.

1 April 2008
Verified
Conference Paper
Closed access
JTJirapond Tadrat
Jirapond Tadrat
VBVeera Boonjing
Veera Boonjing
The paper presents a new text transform algorithm suitable for embedding in compression algorithms. The strategy the new algorithm employed to increase performance of text compression is to replace words with predefined codes. Instead of using a huge dictionary containing exhaustive words as in previous works, the new algorithm uses a list of stoplists and/or frequent words. The research devised different encoding schemes for such a list. It then made experiments of using these schemes with different compression algorithms on standard texts. The result shows that each scheme gives increasing compression when using with specific compression algorithms.