Advancing Age as a Risk Factor for Acute Myocardial Infarction

Background: Acute myocardial infarction (AMI) is one of the leading causes of death in developed and developing countries. Age is an important non-modifiable risk factor for acute myocardial infarction. Objectives: The objective of the study was to explore the relationship of advancing age with the risk of acute myocardial infarction. Methods: It was a cross-sectional study conducted in 2019 after getting approval from Institutional Review board of University of Health Sciences, Lahore. Written informed consent and thorough history was taken from the study participants. Group 1 included 45 AMI patients aged 20-60 years. Group 2 included 45 healthy individuals aged 20-60 years. Independent sample t test and chi-square tests were applied for analysis of data. Results: Mean age was significantly higher in AMI patients (50.52±7.31) as compared to healthy controls (30.67±7.20). The risk of AMI increases with advancing age (p<0.001, OR= 2.78). Conclusions: Advancing age is an important risk factor for acute myocardial infarction.

A Frequent Graph Pattern Mining Approach for Evaluation of Trends in Social Media

Graph mining is a well-established research field and lately it has drawn considerable attention of research communities. It allows to process, analyze, and discover significant knowledge from graph data. Graph mining has been highly motivated by the enormous number of applications. Such applications include Chemoinformatics, Bioinformatics, and societal networks. In graph mining, one of the most challenging tasks is Frequent Subgraph Mining (FSM). FSM has been applied to many domains, such as graphical data management and knowledge discovery, social network analysis, Bioinformatics, and security. In this context, a large number of techniques have been suggested to deal with the graph data. However, FSM approaches are facing some challenges, including enormous numbers of Frequent Subgraph Patterns (FSPs); no suitable mechanism for applying ranking at the appropriate level during the discovery process of the FSPs; extraction of repetitive and duplicate FSPs; user involvement in supplying the support threshold value; large number of subgraph candidate generation; and there exists no specialized scheme to decide the discovered FSPs are optimized patterns as well. Thus, the aim of this research is to make cope with the challenges of enormous FSPs, avoid duplicate discovery of FSPs, use the ranking for the discovered FSPs, and to suggest an optimization strategy to illustrate an association between the frequent and the optimized subgraph patterns. The exploration of this association will further help to decide on the FSPs as optimized FSPs. Therefore, to address the aforementioned challenges a new FSM framework A RAnked Frequent pattern-growth Framework (A-RAFF) is developed. The proposed FSM framework, A-RAFF, provides an efficient answer to these challenges through the initiation of a new ranking measure called FSP-Rank. The proposed ranking measure FSP-Rank, based on the characteristics of the FSPs, effectively reduced the duplicate and enormous FSPs. Moreover, in this study, we have investigated the association between FSPs and optimized subgraph using a Particle Swarm Optimization technique. The effectiveness of the techniques proposed in the dissertation is validated by extensive experimental analysis using different benchmarks, both real and synthetic graph datasets. Finally, our experiments have consistently demonstrated promising empirical results, thus confirming the superiority and practical feasibility of the proposed FSM framework.