Sort:
Open Access Issue
AI-Based Advanced Approaches and Dry Eye Disease Detection Based on Multi-Source Evidence: Cases, Applications, Issues, and Future Directions
Big Data Mining and Analytics 2024, 7 (2): 445-484
Published: 22 April 2024
Downloads:15

This study explores the potential of Artificial Intelligence (AI) in early screening and prognosis of Dry Eye Disease (DED), aiming to enhance the accuracy of therapeutic approaches for eye-care practitioners. Despite the promising opportunities, challenges such as diverse diagnostic evidence, complex etiology, and interdisciplinary knowledge integration impede the interpretability, reliability, and applicability of AI-based DED detection methods. The research conducts a comprehensive review of datasets, diagnostic evidence, and standards, as well as advanced algorithms in AI-based DED detection over the past five years. The DED diagnostic methods are categorized into three groups based on their relationship with AI techniques: (1) those with ground truth and/or comparable standards, (2) potential AI-based methods with significant advantages, and (3) supplementary methods for AI-based DED detection. The study proposes suggested DED detection standards, the combination of multiple diagnostic evidence, and future research directions to guide further investigations. Ultimately, the research contributes to the advancement of ophthalmic disease detection by providing insights into knowledge foundations, advanced methods, challenges, and potential future perspectives, emphasizing the significant role of AI in both academic and practical aspects of ophthalmology.

Open Access Issue
Continuous and Discrete Similarity Coefficient for Identifying Essential Proteins Using Gene Expression Data
Big Data Mining and Analytics 2023, 6 (2): 185-200
Published: 26 January 2023
Downloads:53

Essential proteins play a vital role in biological processes, and the combination of gene expression profiles with Protein-Protein Interaction (PPI) networks can improve the identification of essential proteins. However, gene expression data are prone to significant fluctuations due to noise interference in topological networks. In this work, we discretized gene expression data and used the discrete similarities of the gene expression spectrum to eliminate noise fluctuation. We then proposed the Pearson Jaccard coefficient (PJC) that consisted of continuous and discrete similarities in the gene expression data. Using the graph theory as the basis, we fused the newly proposed similarity coefficient with the existing network topology prediction algorithm at each protein node to recognize essential proteins. This strategy exhibited a high recognition rate and good specificity. We validated the new similarity coefficient PJC on PPI datasets of Krogan, Gavin, and DIP of yeast species and evaluated the results by receiver operating characteristic analysis, jackknife analysis, top analysis, and accuracy analysis. Compared with that of node-based network topology centrality and fusion biological information centrality methods, the new similarity coefficient PJC showed a significantly improved prediction performance for essential proteins in DC, IC, Eigenvector centrality, subgraph centrality, betweenness centrality, closeness centrality, NC, PeC, and WDC. We also compared the PJC coefficient with other methods using the NF-PIN algorithm, which predicts proteins by constructing active PPI networks through dynamic gene expression. The experimental results proved that our newly proposed similarity coefficient PJC has superior advantages in predicting essential proteins.

total 2