1 February 2023 in International Journal of Electrical and Computer Engineering (IJECE)
Clustering methods in data mining aim to group a set of patterns based on their similarity. In a data survey, heterogeneous information is established with various types of data scales like nominal, ordinal, binary, and Likert scales. A lack of treatment of heterogeneous data and information leads to loss of information and scanty decision-making. Although many similarity measures have been established, solutions for heterogeneous data in clustering are still lacking. The recent entropy distance measure seems to provide good results for the heterogeneous categorical data. However, it requires many experiments and evaluations. This article presents a proposed framework for heterogeneous categorical data solution using a mini batch k-means with entropy measure (MBKEM) which is to investigate the effectiveness of similarity measure in clustering method using heterogeneous categorical data. Secondary data from a public survey was used. The findings demonstrate the proposed framework has improved the clustering’s quality. MBKEM outperformed other clustering algorithms with the accuracy at 0.88, v-measure (VM) at 0.82, adjusted rand index (ARI) at 0.87, and Fowlkes-Mallow’s index (FMI) at 0.94. It is observed that the average minimum elapsed time-varying for cluster generation, k at 0.26 s. In the future, the proposed solution would be beneficial for improving the quality of clustering for heterogeneous categorical data problems in many domains.
17 March 2026 in IEEE Transactions on Dependable and Secure Computing
Privacy-preserving blockchain systems in regulated financial environments must simultaneously satisfy transaction confidentiality and regulatory compliance requirements. Existing schemes predominantly rely on elliptic curve cryptography, rendering them vulnerable to Harvest Now, Decrypt Later (HNDL) attacks posed by quantum computing advances. This paper proposes L-HCPM (Lattice-based Hybrid Cryptographic Protocol Model), a privacy-preserving blockchain protocol based on lattice cryptography that achieves both post-quantum security and regulatory auditability. The core contribution is the LT-Share (Lattice Trapdoor Shared Randomness) mechanism, which leverages GPV08/MP12 lattice trapdoor sampling to generate shared randomness between users and regulators, enabling regulators to independently decrypt transactions without user cooperation. To address the non-reproducibility of Peikert randomized sampling under the UTXO model, we introduce an off-chain caching architecture to ensure sampling consistency. We further extend the Universal Composability (UC) framework by introducing a hybrid adversary model, formally proving the secure composability of quantum-secure and classical-secure components. Experimental evaluation based on a complete prototype system demonstrates that post-quantum cryptographic overhead accounts for only 0.17% of end-to-end latency, with Gas consumption ranging from 337 K to 686 K, and regulatory decryption achieving 100% success rate, validating the practical feasibility of post-quantum security upgrades.
1 November 2023 in Indonesian Journal of Electrical Engineering and Computer Science
Breast cancer is a serious disease that requires data analysis for diagnosis and treatment. Clustering is a data mining technique that is often used in breast cancer research to assess the level of malignancy at an early stage. However, clustering categorical data can be challenging because different levels in categorical variables can impact the clustering process. This research proposes a modified entropy measure (MEM) to enhance clustering performance. MEM aims to address the issue of distance-based measures in clustering categorical data. It is also a useful tool for assessing data loss in categorical clustering, which helps to understand the patterns and relationships by quantifying the information lost during clustering. An evaluation compares k-modes+MEM, k-means+MEM, DBSCAN+MEM, and affinity+MEM with conventional clustering algorithms. The assessment metrics of clustering accuracy, intra-cluster distance and fowlkes-mallow index (FMI) are employed to evaluate the algorithm performance. Experimental results show significant improvements. k-Modes+MEM algorithm achieves a reduction in average intra-cluster distance and outperforms other algorithms in accuracy, intra-cluster distance, and FMI. The proposed algorithm can be extended to heterogeneous datasets in various domains such as healthcare, finance, and marketing.