Ian Kim Teck Tan
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
Ian Kim Teck Tan has a total of 82 co-authors. Here are the top co-authors by number of shared publications:
Poo Kuan Hoong
Data Science Department Nielsen Malaysia Petaling Jaya, Selangor, 46200
5 shared publications- Poo Kuan Hoong
Faculty of Information Technology, Multimedia University, Cyberjaya, Malaysia
5 shared publications - Chee Keong Tan
School of Information Technology, Monash University Malaysia, Jalan Lagoon Selatan, Bandar Sunway, Selangor, Malaysia
4 shared publications - Chee Siang Wong
Universiti Tunku Abdul Rahman
4 shared publications - Lai-Kuan Wong
Faculty of Computing and Informatics, Multimedia University, Cyberjaya, Selangor, Malaysia
4 shared publications - Timothy Tzen Vun Yap
Heriot-Watt University Malaysia
4 shared publications
Latest Publications
- Open Access
- 3 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 121-128
Discrete-time quantum walk search on the dihedral Cayley graph
- 3 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 121-128
Open AccessDiscrete-time quantum walk search on the dihedral Cayley graph
- Open Access
- 23 January 2026
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 19  (1)
Multitask Learning and BERT Embedding: A Comprehensive Approach to Subjectivity Detection and Aspect-Based Sentiment Analysis
- 23 January 2026
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 19  (1)
Open AccessMultitask Learning and BERT Embedding: A Comprehensive Approach to Subjectivity Detection and Aspect-Based Sentiment Analysis
- Open Access
- 3 October 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24  (10) , 1-24
Discrete-time quantum walk search on the cycle graph with weighted self-loop
The evolution operator of the lackadaisical quantum walk on a weighted cycle graph with self-loop weight $$w>0$$ is examined. With Grover oracle, the effect of different values of $$w$$ on the success probability of the search under various hyperparameter combinations is analyzed. The success probability function of the first few steps is provided algebraically, which in turn highlights the role of $$w$$ in governing the evolutionary behavior of the quantum walk search. These studies subsequently allow the numerical results to be obtained for various hyperparameter combinations, showing that the highest success probability for the weighted cycle graph with $$N$$ vertices is achieved using a flip-flop shift operator, a weighted coin superposition initial state, and $$w=\frac{1.26}{N}$$ . A comparison is also made with other known oracle, demonstrating that the proposed configuration provides a better trade-off between success probability and runtime. An extension of the study to the SKW scheme is also included, and it demonstrates that the scheme provides more variability and potential for quantum walk search.- 3 October 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24  (10) , 1-24
Open AccessDiscrete-time quantum walk search on the cycle graph with weighted self-loop
The evolution operator of the lackadaisical quantum walk on a weighted cycle graph with self-loop weight $$w>0$$ is examined. With Grover oracle, the effect of different values of $$w$$ on the success probability of the search under various hyperparameter combinations is analyzed. The success probability function of the first few steps is provided algebraically, which in turn highlights the role of $$w$$ in governing the evolutionary behavior of the quantum walk search. These studies subsequently allow the numerical results to be obtained for various hyperparameter combinations, showing that the highest success probability for the weighted cycle graph with $$N$$ vertices is achieved using a flip-flop shift operator, a weighted coin superposition initial state, and $$w=\frac{1.26}{N}$$ . A comparison is also made with other known oracle, demonstrating that the proposed configuration provides a better trade-off between success probability and runtime. An extension of the study to the SKW scheme is also included, and it demonstrates that the scheme provides more variability and potential for quantum walk search. - Open Access
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 251-257
A Kubernetes-Based Framework for Simulating Gossip Protocols in Blockchain Networks
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 251-257
Open AccessA Kubernetes-Based Framework for Simulating Gossip Protocols in Blockchain Networks
- Open Access
- 6 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 204-211
On Automated Essay Grading using Large Language Models
- 6 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 204-211
Open AccessOn Automated Essay Grading using Large Language Models
- Open Access
- 25 October 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81  (1) , 1-33
DAP-CBR: enhancing Bitcoin block propagation efficiency using dynamic compact block relay’s prefilling of transactions
This study examines the potential of BIP-152’s Compact Block Relay (CBR) to enhance the Bitcoin network. This work explores the block propagation efficiency through dynamic prefilling of transactions. In addition, an enhanced CBR model is proposed to reduce superfluous transaction requests, thus improving the block distribution process. The analysis considers the impact of the dynamically prefilled transactions on Bitcoin network scalability, comparing the advantages and disadvantages of this approach. We also conduct a comparative study of fixed-size and dynamically sized prefilled transactions to highlight the importance of adapting to network demands. Prefilling a fixed number of transactions without considering demand can cause inefficiencies and strain the network with unnecessary bandwidth use. Indiscriminate prefilling exacerbates these issues by inflating data packets unnecessarily, increasing latency and reducing network responsiveness. Our research indicates that the proposed solution can significantly reduce the number of round-trips between network nodes by an average of 29.77% and block reconstruction latency by 39.10% when compared with the CBR.
- 25 October 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81  (1) , 1-33
Open AccessDAP-CBR: enhancing Bitcoin block propagation efficiency using dynamic compact block relay’s prefilling of transactions
This study examines the potential of BIP-152’s Compact Block Relay (CBR) to enhance the Bitcoin network. This work explores the block propagation efficiency through dynamic prefilling of transactions. In addition, an enhanced CBR model is proposed to reduce superfluous transaction requests, thus improving the block distribution process. The analysis considers the impact of the dynamically prefilled transactions on Bitcoin network scalability, comparing the advantages and disadvantages of this approach. We also conduct a comparative study of fixed-size and dynamically sized prefilled transactions to highlight the importance of adapting to network demands. Prefilling a fixed number of transactions without considering demand can cause inefficiencies and strain the network with unnecessary bandwidth use. Indiscriminate prefilling exacerbates these issues by inflating data packets unnecessarily, increasing latency and reducing network responsiveness. Our research indicates that the proposed solution can significantly reduce the number of round-trips between network nodes by an average of 29.77% and block reconstruction latency by 39.10% when compared with the CBR.
- 5 September 2024
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 15  (11) , 3745-3757
Kernel density-based radio map optimization using human trajectory for indoor localization
- 5 September 2024
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 15  (11) , 3745-3757
Kernel density-based radio map optimization using human trajectory for indoor localization
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3153  (1) , 020001
Towards automated financial market knowledge graph construction
The prevalence of financial news on the internet has made it easier for investors to access information. However, the fast-changing nature of the financial mark The prevalence of financial news on the internet has made it easier for investors to access information. However, the fast-changing nature of the financial mark
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3153  (1) , 020001
Towards automated financial market knowledge graph construction
The prevalence of financial news on the internet has made it easier for investors to access information. However, the fast-changing nature of the financial mark The prevalence of financial news on the internet has made it easier for investors to access information. However, the fast-changing nature of the financial mark
- 29 December 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80  (8) , 10667-10694
C-VoNNI: a precise fingerprint construction for indoor positioning systems using natural neighbor methods with clustering-based Voronoi diagrams
- 29 December 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80  (8) , 10667-10694
C-VoNNI: a precise fingerprint construction for indoor positioning systems using natural neighbor methods with clustering-based Voronoi diagrams
- Open Access
- 8 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 190-194
Towards Discrete Object Representations in Vision Transformers with Tensor Products
In this work, we explore the use of Tensor Product Representations (TPRs) in a Vision Transformer model to form image representations that can later be used for symbolic manipulation in a neurosymbolic model. We propose the Tensor Product Vision Transformer (TP-ViT), an enhancement of a Vision Transformer that incorporates TPRs, an object representation methodology that utilizes filler and role vectors to represent objects. TP-ViT is the first application of TPRs on visual input, and we report qualitative and quantitative results which show that the use of TPRs allows for the formation of more targeted and diverse object representations when compared to a standard Vision Transformer.
- 8 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 190-194
Open AccessTowards Discrete Object Representations in Vision Transformers with Tensor Products
In this work, we explore the use of Tensor Product Representations (TPRs) in a Vision Transformer model to form image representations that can later be used for symbolic manipulation in a neurosymbolic model. We propose the Tensor Product Vision Transformer (TP-ViT), an enhancement of a Vision Transformer that incorporates TPRs, an object representation methodology that utilizes filler and role vectors to represent objects. TP-ViT is the first application of TPRs on visual input, and we report qualitative and quantitative results which show that the use of TPRs allows for the formation of more targeted and diverse object representations when compared to a standard Vision Transformer.