The growing reliance on digital financial services necessitates a secure, efficient, and privacy-centric approach to identity verification and Know Your Customer (KYC) compliance. Traditional identity management systems rely on centralized databases, making them susceptible to data breaches, inefficiencies, and regulatory constraints. Over 10 billion identity records have been exposed in centralized KYC breaches, leading to a 60% increase in financial fraud cases. The rise of Decentralized Finance (DeFi) has further complicated KYC compliance, requiring innovative solutions that balance privacy and regulatory requirements. This paper proposes a Web3-powered decentralized identity framework that leverages blockchain technology, self-sovereign identity (SSI), verifiable credentials (VCs), and zero-knowledge proofs (ZKPs). By eliminating reliance on centralized authorities, our system enhances data privacy, reducing personally identifiable information (PII) disclosure by 80% while ensuring compliance with AML and GDPR regulations. The integration of zk-SNARKs enables trustless identity verification with an average proof generation time of 12.5 seconds, significantly reducing the 3–5 day verification period required by traditional systems. Smart contract-based KYC automation eliminates intermediaries, cutting compliance costs by 40% and reducing fraud risk by 60%. Through comparative analysis, we highlight that decentralized KYC improves security, cost-effectiveness, and scalability compared to traditional models. Performance evaluation confirms that transaction throughput remains within acceptable blockchain limits, with gas costs stabilized at 35,000–55,000 Gwei per verification request. Despite challenges in regulatory adaptation and zk-SNARK scalability, the proposed model demonstrates the feasibility of Web3-driven identity management for trustless, privacy-preserving, and compliant financial ecosystems.

With ever-increasing dataset size and data storage capacity, there is a strong need to build systems that can effectively utilize these vast datasets to extract valuable information. Large datasets often exhibit sparsity and pose cold start problems, necessitating the development of responsible recommender systems. Knowledge graphs have utility in responsibly representing information related to recommendation scenarios. However, many studies overlook explicitly encoding contextual information, which is crucial for reducing the bias of multi-layer propagation. Additionally, existing methods stack multiple layers to encode high-order neighbor information while disregarding the relational information between items and entities. This oversight hampers their ability to capture the collaborative signal latent in user-item interactions. This is particularly important in health informatics, where knowledge graphs consist of various entities connected to items through different relations. Ignoring the relational information renders them insufficient for modeling user preferences. This work presents an end-to-end recommendation framework named KGCAN (Knowledge Graph Enhanced Contextualized Attention-Based Network), which explicitly encodes both relational and contextual information of entities to preserve the original entity information. Furthermore, a user-specific attention mechanism is employed to capture personalized recommendations. The proposed model is validated on three benchmark datasets through extensive experiments. The experimental results demonstrate that KGCAN outperforms existing knowledge graph based recommendation models. Additionally, a case study from the healthcare domain is discussed, highlighting the importance of attention mechanisms and high-order connectivity in the responsible recommendation system for health informatics.

Frequent itemsets mining is an active research problem in the domain of data mining and knowledge discovery. With the advances in database technology and an exponential increase in data to be stored, there is a need for efficient approaches that can quickly extract useful information from such large datasets. Frequent Itemsets (FIs) mining is a data mining task to find itemsets in a transactional database which occur together above a certain frequency. Finding these FIs usually requires multiple passes over the databases; therefore, making efficient algorithms crucial for mining FIs. This work presents a graph-based approach for representing a complete transactional database. The proposed graph-based representation enables the storing of all relevant information (for extracting FIs) of the database in one pass. Later, an algorithm that extracts the FIs from the graph-based structure is presented. Experimental results are reported comparing the proposed approach with 17 related FIs mining methods using six benchmark datasets. Results show that the proposed approach performs better than others in terms of time.