Displaying publications 1 - 20 of 142 in total

Abstract:
Sort:
  1. Hu SJ, Chong CS, Subas S
    Health Phys, 1981 Feb;40(2):248-50.
    PMID: 7216807
    Matched MeSH terms: Mining*
  2. Shirkhorshidi AS, Aghabozorgi S, Wah TY
    PLoS One, 2015;10(12):e0144059.
    PMID: 26658987 DOI: 10.1371/journal.pone.0144059
    Similarity or distance measures are core components used by distance-based clustering algorithms to cluster similar data points into the same clusters, while dissimilar or distant data points are placed into different clusters. The performance of similarity measures is mostly addressed in two or three-dimensional spaces, beyond which, to the best of our knowledge, there is no empirical study that has revealed the behavior of similarity measures when dealing with high-dimensional datasets. To fill this gap, a technical framework is proposed in this study to analyze, compare and benchmark the influence of different similarity measures on the results of distance-based clustering algorithms. For reproducibility purposes, fifteen publicly available datasets were used for this study, and consequently, future distance measures can be evaluated and compared with the results of the measures discussed in this work. These datasets were classified as low and high-dimensional categories to study the performance of each measure against each category. This research should help the research community to identify suitable distance measures for datasets and also to facilitate a comparison and evaluation of the newly proposed similarity or distance measures with traditional ones.
    Matched MeSH terms: Data Mining/statistics & numerical data*
  3. Paul J, Jacob J, Mahmud M, Vaka M, Krishnan SG, Arifutzzaman A, et al.
    Int J Biol Macromol, 2024 Apr;265(Pt 2):130850.
    PMID: 38492706 DOI: 10.1016/j.ijbiomac.2024.130850
    Recent decades have witnessed a surge in research interest in bio-nanocomposite-based packaging materials, but still, a lack of systematic analysis exists in this domain. Bio-based packaging materials pose a sustainable alternative to petroleum-based packaging materials. The current work employs bibliometric analysis to deliver a comprehensive outline on the role of bio nanocomposites in packaging. India, Iran, and China were revealed to be the top three nations actively engaged in this domain in total publications. Islamic Azad University in Iran and Universiti Putra Malaysia in Malaysia are among the world's best institutions in active research and publications in this field. The extensive collaboration between nations and institutions highlights the significance of a holistic approach towards bio-nanocomposite. The National Natural Science Foundation of China is the leading funding body in this field of research. Among authors, Jong whan Rhim secured the topmost citations (2234) in this domain (13 publications). Among journals, Carbohydrate Polymers secured the maximum citation count (4629) from 36 articles; the initial one was published in 2011. Bio nanocomposite is the most frequently used keyword. Researchers and policymakers focussing on sustainable packaging solutions will gain crucial insights on the current research status on packaging solutions using bio-nanocomposites from the conclusions.
    Matched MeSH terms: Data Mining
  4. Liu J, Yinchai W, Siong TC, Li X, Zhao L, Wei F
    Sci Rep, 2022 Dec 01;12(1):20770.
    PMID: 36456582 DOI: 10.1038/s41598-022-23765-x
    For generating an interpretable deep architecture for identifying deep intrusion patterns, this study proposes an approach that combines ANFIS (Adaptive Network-based Fuzzy Inference System) and DT (Decision Tree) for interpreting the deep pattern of intrusion detection. Meanwhile, for improving the efficiency of training and predicting, Pearson Correlation analysis, standard deviation, and a new adaptive K-means are used to select attributes and make fuzzy interval decisions. The proposed algorithm was trained, validated, and tested on the NSL-KDD (National security lab-knowledge discovery and data mining) dataset. Using 22 attributes that highly related to the target, the performance of the proposed method achieves a 99.86% detection rate and 0.14% false alarm rate on the KDDTrain+ dataset, a 77.46% detection rate on the KDDTest+ dataset, which is better than many classifiers. Besides, the interpretable model can help us demonstrate the complex and overlapped pattern of intrusions and analyze the pattern of various intrusions.
    Matched MeSH terms: Data Mining
  5. Abdar M, Książek W, Acharya UR, Tan RS, Makarenkov V, Pławiak P
    Comput Methods Programs Biomed, 2019 Oct;179:104992.
    PMID: 31443858 DOI: 10.1016/j.cmpb.2019.104992
    BACKGROUND AND OBJECTIVE: Coronary artery disease (CAD) is one of the commonest diseases around the world. An early and accurate diagnosis of CAD allows a timely administration of appropriate treatment and helps to reduce the mortality. Herein, we describe an innovative machine learning methodology that enables an accurate detection of CAD and apply it to data collected from Iranian patients.

    METHODS: We first tested ten traditional machine learning algorithms, and then the three-best performing algorithms (three types of SVM) were used in the rest of the study. To improve the performance of these algorithms, a data preprocessing with normalization was carried out. Moreover, a genetic algorithm and particle swarm optimization, coupled with stratified 10-fold cross-validation, were used twice: for optimization of classifier parameters and for parallel selection of features.

    RESULTS: The presented approach enhanced the performance of all traditional machine learning algorithms used in this study. We also introduced a new optimization technique called N2Genetic optimizer (a new genetic training). Our experiments demonstrated that N2Genetic-nuSVM provided the accuracy of 93.08% and F1-score of 91.51% when predicting CAD outcomes among the patients included in a well-known Z-Alizadeh Sani dataset. These results are competitive and comparable to the best results in the field.

    CONCLUSIONS: We showed that machine-learning techniques optimized by the proposed approach, can lead to highly accurate models intended for both clinical and research use.

    Matched MeSH terms: Data Mining/statistics & numerical data
  6. Hakak S, Kamsin A, Shivakumara P, Idna Idris MY, Gilkar GA
    PLoS One, 2018;13(7):e0200912.
    PMID: 30048486 DOI: 10.1371/journal.pone.0200912
    Exact pattern matching algorithms are popular and used widely in several applications, such as molecular biology, text processing, image processing, web search engines, network intrusion detection systems and operating systems. The focus of these algorithms is to achieve time efficiency according to applications but not memory consumption. In this work, we propose a novel idea to achieve both time efficiency and memory consumption by splitting query string for searching in Corpus. For a given text, the proposed algorithm split the query pattern into two equal halves and considers the second (right) half as a query string for searching in Corpus. Once the match is found with second halves, the proposed algorithm applies brute force procedure to find remaining match by referring the location of right half. Experimental results on different S1 Dataset, namely Arabic, English, Chinese, Italian and French text databases show that the proposed algorithm outperforms the existing S1 Algorithm in terms of time efficiency and memory consumption as the length of the query pattern increases.
    Matched MeSH terms: Data Mining/methods*
  7. Yazdani A, Varathan KD, Chiam YK, Malik AW, Wan Ahmad WA
    BMC Med Inform Decis Mak, 2021 06 21;21(1):194.
    PMID: 34154576 DOI: 10.1186/s12911-021-01527-5
    BACKGROUND: Cardiovascular disease is the leading cause of death in many countries. Physicians often diagnose cardiovascular disease based on current clinical tests and previous experience of diagnosing patients with similar symptoms. Patients who suffer from heart disease require quick diagnosis, early treatment and constant observations. To address their needs, many data mining approaches have been used in the past in diagnosing and predicting heart diseases. Previous research was also focused on identifying the significant contributing features to heart disease prediction, however, less importance was given to identifying the strength of these features.

    METHOD: This paper is motivated by the gap in the literature, thus proposes an algorithm that measures the strength of the significant features that contribute to heart disease prediction. The study is aimed at predicting heart disease based on the scores of significant features using Weighted Associative Rule Mining.

    RESULTS: A set of important feature scores and rules were identified in diagnosing heart disease and cardiologists were consulted to confirm the validity of these rules. The experiments performed on the UCI open dataset, widely used for heart disease research yielded the highest confidence score of 98% in predicting heart disease.

    CONCLUSION: This study managed to provide a significant contribution in computing the strength scores with significant predictors in heart disease prediction. From the evaluation results, we obtained important rules and achieved highest confidence score by utilizing the computed strength scores of significant predictors on Weighted Associative Rule Mining in predicting heart disease.

    Matched MeSH terms: Data Mining
  8. Aqra I, Herawan T, Abdul Ghani N, Akhunzada A, Ali A, Bin Razali R, et al.
    PLoS One, 2018;13(1):e0179703.
    PMID: 29351287 DOI: 10.1371/journal.pone.0179703
    Designing an efficient association rule mining (ARM) algorithm for multilevel knowledge-based transactional databases that is appropriate for real-world deployments is of paramount concern. However, dynamic decision making that needs to modify the threshold either to minimize or maximize the output knowledge certainly necessitates the extant state-of-the-art algorithms to rescan the entire database. Subsequently, the process incurs heavy computation cost and is not feasible for real-time applications. The paper addresses efficiently the problem of threshold dynamic updation for a given purpose. The paper contributes by presenting a novel ARM approach that creates an intermediate itemset and applies a threshold to extract categorical frequent itemsets with diverse threshold values. Thus, improving the overall efficiency as we no longer needs to scan the whole database. After the entire itemset is built, we are able to obtain real support without the need of rebuilding the itemset (e.g. Itemset list is intersected to obtain the actual support). Moreover, the algorithm supports to extract many frequent itemsets according to a pre-determined minimum support with an independent purpose. Additionally, the experimental results of our proposed approach demonstrate the capability to be deployed in any mining system in a fully parallel mode; consequently, increasing the efficiency of the real-time association rules discovery process. The proposed approach outperforms the extant state-of-the-art and shows promising results that reduce computation cost, increase accuracy, and produce all possible itemsets.
    Matched MeSH terms: Data Mining/methods*
  9. Tan JL, Khang TF, Ngeow YF, Choo SW
    BMC Genomics, 2013;14:879.
    PMID: 24330254 DOI: 10.1186/1471-2164-14-879
    Mycobacterium abscessus is a rapidly growing mycobacterium that is often associated with human infections. The taxonomy of this species has undergone several revisions and is still being debated. In this study, we sequenced the genomes of 12 M. abscessus strains and used phylogenomic analysis to perform subspecies classification.
    Matched MeSH terms: Data Mining
  10. Nilashi M, Ahmadi H, Shahmoradi L, Ibrahim O, Akbari E
    J Infect Public Health, 2018 10 04;12(1):13-20.
    PMID: 30293875 DOI: 10.1016/j.jiph.2018.09.009
    BACKGROUND: Hepatitis is an inflammation of the liver, most commonly caused by a viral infection. Supervised data mining techniques have been successful in hepatitis disease diagnosis through a set of datasets. Many methods have been developed by the aids of data mining techniques for hepatitis disease diagnosis. The majority of these methods are developed by single learning techniques. In addition, these methods do not support the ensemble learning of the data. Combining the outputs of several predictors can result in improved accuracy in classification problems. This study aims to propose an accurate method for the hepatitis disease diagnosis by taking the advantages of ensemble learning.

    METHODS: We use Non-linear Iterative Partial Least Squares to perform the data dimensionality reduction, Self-Organizing Map technique for clustering task and ensembles of Neuro-Fuzzy Inference System for predicting the hepatitis disease. We also use decision trees for the selection of most important features in the experimental dataset. We test our method on a real-world dataset and present our results in comparison with the latest results of previous studies.

    RESULTS: The results of our analyses on the dataset demonstrated that our method performance is superior to the Neural Network, ANFIS, K-Nearest Neighbors and Support Vector Machine.

    CONCLUSIONS: The method has potential to be used as an intelligent learning system for hepatitis disease diagnosis in the healthcare.

    Matched MeSH terms: Data Mining
  11. Zolhavarieh S, Aghabozorgi S, Teh YW
    ScientificWorldJournal, 2014;2014:312521.
    PMID: 25140332 DOI: 10.1155/2014/312521
    Clustering of subsequence time series remains an open issue in time series clustering. Subsequence time series clustering is used in different fields, such as e-commerce, outlier detection, speech recognition, biological systems, DNA recognition, and text mining. One of the useful fields in the domain of subsequence time series clustering is pattern recognition. To improve this field, a sequence of time series data is used. This paper reviews some definitions and backgrounds related to subsequence time series clustering. The categorization of the literature reviews is divided into three groups: preproof, interproof, and postproof period. Moreover, various state-of-the-art approaches in performing subsequence time series clustering are discussed under each of the following categories. The strengths and weaknesses of the employed methods are evaluated as potential issues for future studies.
    Matched MeSH terms: Data Mining*
  12. Naila A, Meerdink G, Jayasena V, Sulaiman AZ, Ajit AB, Berta G
    Environ Sci Pollut Res Int, 2019 Sep;26(26):26449-26471.
    PMID: 31363977 DOI: 10.1007/s11356-019-05992-4
    The biosphere is polluted with metals due to burning of fossil fuels, pesticides, fertilizers, and mining. The metals interfere with soil conservations such as contaminating aqueous waste streams and groundwater, and the evidence of this has been recorded since 1900. Heavy metals also impact human health; therefore, the emancipation of the environment from these environmental pollutants is critical. Traditionally, techniques to remove these metals include soil washing, removal, and excavation. Metal-accumulating plants could be utilized to remove these metal pollutants which would be an alternative option that would simultaneously benefit commercially and at the same time clean the environment from these pollutants. Commercial application of pollutant metals includes biofortification, phytomining, phytoremediation, and intercropping. This review discusses about the metal-accumulating plants, mechanism of metal accumulation, enhancement of metal accumulation, potential commercial applications, research trends, and research progress to enhance the metal accumulation, benefits, and limitations of metal accumulators. The review identified that the metal accumulator plants only survive in low or medium polluted environments with heavy metals. Also, more research is required about metal accumulators in terms of genetics, breeding potential, agronomics, and the disease spectrum. Moreover, metal accumulators' ability to uptake metals need to be optimized by enhancing metal transportation, transformation, tolerance to toxicity, and volatilization in the plant. This review would benefit the industries and environment management authorities as it provides up-to-date research information about the metal accumulators, limitation of the technology, and what could be done to improve the metal enhancement in the future.
    Matched MeSH terms: Mining
  13. Hassan NA, Sahani M, Hod R, Yahya NA
    J Environ Health, 2015 1 27;77(6):42-8.
    PMID: 25619035
    Cyanidation in gold extraction has detrimental impacts on the ecosystem and the population in surrounding areas. The research described in this article aimed to assess the health effects of environmental exposure to cyanide in a community near a gold mining area in Malaysia. A total of 255 members of the exposed community and 117 members of the control community answered questionnaires on their exposure to a gold mine and health outcomes. Urine samples were collected for biomarker assessment (i.e., urinary thiocyanate). The authors found that the mean level of urinary thiocyanate was significantly higher among the exposed community (0.30 ± 0.26 mg/dL) than the control community (0.24 ± 0.23 mg/dL) (p = .0021). The exposed community had a significantly higher prevalence of headaches (prevalence odds ratio [pOR] = 2.6, p = .001), dizziness (pOR = 3.7, p < .001), skin irritation (pOR = 2.1, p = .040), and eye irritation (pOR = 5.1, p = .004). No association occurred between dietary exposure and urinary biomarkers. Smokers living near a gold mine had a higher urinary thiocyanate level (0.56 mg/dL) than smokers in the control community (0.49 mg/dL).
    Matched MeSH terms: Mining
  14. Himmat M, Salim N, Al-Dabbagh MM, Saeed F, Ahmed A
    Molecules, 2016 Apr 13;21(4):476.
    PMID: 27089312 DOI: 10.3390/molecules21040476
    Quantifying the similarity of molecules is considered one of the major tasks in virtual screening. There are many similarity measures that have been proposed for this purpose, some of which have been derived from document and text retrieving areas as most often these similarity methods give good results in document retrieval and can achieve good results in virtual screening. In this work, we propose a similarity measure for ligand-based virtual screening, which has been derived from a text processing similarity measure. It has been adopted to be suitable for virtual screening; we called this proposed measure the Adapted Similarity Measure of Text Processing (ASMTP). For evaluating and testing the proposed ASMTP we conducted several experiments on two different benchmark datasets: the Maximum Unbiased Validation (MUV) and the MDL Drug Data Report (MDDR). The experiments have been conducted by choosing 10 reference structures from each class randomly as queries and evaluate them in the recall of cut-offs at 1% and 5%. The overall obtained results are compared with some similarity methods including the Tanimoto coefficient, which are considered to be the conventional and standard similarity coefficients for fingerprint-based similarity calculations. The achieved results show that the performance of ligand-based virtual screening is better and outperforms the Tanimoto coefficients and other methods.
    Matched MeSH terms: Data Mining*
  15. Ashkani S, Yusop MR, Shabanimofrad M, Azady A, Ghasemzadeh A, Azizi P, et al.
    Curr Issues Mol Biol, 2015;17:57-73.
    PMID: 25706446
    Allele mining is a promising way to dissect naturally occurring allelic variants of candidate genes with essential agronomic qualities. With the identification, isolation and characterisation of blast resistance genes in rice, it is now possible to dissect the actual allelic variants of these genes within an array of rice cultivars via allele mining. Multiple alleles from the complex locus serve as a reservoir of variation to generate functional genes. The routine sequence exchange is one of the main mechanisms of R gene evolution and development. Allele mining for resistance genes can be an important method to identify additional resistance alleles and new haplotypes along with the development of allele-specific markers for use in marker-assisted selection. Allele mining can be visualised as a vital link between effective utilisation of genetic and genomic resources in genomics-driven modern plant breeding. This review studies the actual concepts and potential of mining approaches for the discovery of alleles and their utilisation for blast resistance genes in rice. The details provided here will be important to provide the rice breeder with a worthwhile introduction to allele mining and its methodology for breakthrough discovery of fresh alleles hidden in hereditary diversity, which is vital for crop improvement.
    Matched MeSH terms: Data Mining/methods*
  16. Shabanzadeh P, Yusof R
    Comput Math Methods Med, 2015;2015:802754.
    PMID: 26336509 DOI: 10.1155/2015/802754
    Unsupervised data classification (or clustering) analysis is one of the most useful tools and a descriptive task in data mining that seeks to classify homogeneous groups of objects based on similarity and is used in many medical disciplines and various applications. In general, there is no single algorithm that is suitable for all types of data, conditions, and applications. Each algorithm has its own advantages, limitations, and deficiencies. Hence, research for novel and effective approaches for unsupervised data classification is still active. In this paper a heuristic algorithm, Biogeography-Based Optimization (BBO) algorithm, was adapted for data clustering problems by modifying the main operators of BBO algorithm, which is inspired from the natural biogeography distribution of different species. Similar to other population-based algorithms, BBO algorithm starts with an initial population of candidate solutions to an optimization problem and an objective function that is calculated for them. To evaluate the performance of the proposed algorithm assessment was carried on six medical and real life datasets and was compared with eight well known and recent unsupervised data classification algorithms. Numerical results demonstrate that the proposed evolutionary optimization algorithm is efficient for unsupervised data classification.
    Matched MeSH terms: Data Mining/methods*; Data Mining/statistics & numerical data
  17. Uddin J, Ghazali R, Deris MM
    PLoS One, 2017;12(1):e0164803.
    PMID: 28068344 DOI: 10.1371/journal.pone.0164803
    Clustering a set of objects into homogeneous groups is a fundamental operation in data mining. Recently, many attentions have been put on categorical data clustering, where data objects are made up of non-numerical attributes. For categorical data clustering the rough set based approaches such as Maximum Dependency Attribute (MDA) and Maximum Significance Attribute (MSA) has outperformed their predecessor approaches like Bi-Clustering (BC), Total Roughness (TR) and Min-Min Roughness(MMR). This paper presents the limitations and issues of MDA and MSA techniques on special type of data sets where both techniques fails to select or faces difficulty in selecting their best clustering attribute. Therefore, this analysis motivates the need to come up with better and more generalize rough set theory approach that can cope the issues with MDA and MSA. Hence, an alternative technique named Maximum Indiscernible Attribute (MIA) for clustering categorical data using rough set indiscernible relations is proposed. The novelty of the proposed approach is that, unlike other rough set theory techniques, it uses the domain knowledge of the data set. It is based on the concept of indiscernibility relation combined with a number of clusters. To show the significance of proposed approach, the effect of number of clusters on rough accuracy, purity and entropy are described in the form of propositions. Moreover, ten different data sets from previously utilized research cases and UCI repository are used for experiments. The results produced in tabular and graphical forms shows that the proposed MIA technique provides better performance in selecting the clustering attribute in terms of purity, entropy, iterations, time, accuracy and rough accuracy.
    Matched MeSH terms: Data Mining
  18. Molinari F, Raghavendra U, Gudigar A, Meiburger KM, Rajendra Acharya U
    Med Biol Eng Comput, 2018 Sep;56(9):1579-1593.
    PMID: 29473126 DOI: 10.1007/s11517-018-1792-5
    Atherosclerosis is a type of cardiovascular disease which may cause stroke. It is due to the deposition of fatty plaque in the artery walls resulting in the reduction of elasticity gradually and hence restricting the blood flow to the heart. Hence, an early prediction of carotid plaque deposition is important, as it can save lives. This paper proposes a novel data mining framework for the assessment of atherosclerosis in its early stage using ultrasound images. In this work, we are using 1353 symptomatic and 420 asymptomatic carotid plaque ultrasound images. Our proposed method classifies the symptomatic and asymptomatic carotid plaques using bidimensional empirical mode decomposition (BEMD) and entropy features. The unbalanced data samples are compensated using adaptive synthetic sampling (ADASYN), and the developed method yielded a promising accuracy of 91.43%, sensitivity of 97.26%, and specificity of 83.22% using fourteen features. Hence, the proposed method can be used as an assisting tool during the regular screening of carotid arteries in hospitals. Graphical abstract Outline for our efficient data mining framework for the characterization of symptomatic and asymptomatic carotid plaques.
    Matched MeSH terms: Data Mining*
  19. Jahanirad M, Wahab AW, Anuar NB
    Forensic Sci Int, 2016 May;262:242-75.
    PMID: 27060542 DOI: 10.1016/j.forsciint.2016.03.035
    Camera attribution plays an important role in digital image forensics by providing the evidence and distinguishing characteristics of the origin of the digital image. It allows the forensic analyser to find the possible source camera which captured the image under investigation. However, in real-world applications, these approaches have faced many challenges due to the large set of multimedia data publicly available through photo sharing and social network sites, captured with uncontrolled conditions and undergone variety of hardware and software post-processing operations. Moreover, the legal system only accepts the forensic analysis of the digital image evidence if the applied camera attribution techniques are unbiased, reliable, nondestructive and widely accepted by the experts in the field. The aim of this paper is to investigate the evolutionary trend of image source camera attribution approaches from fundamental to practice, in particular, with the application of image processing and data mining techniques. Extracting implicit knowledge from images using intrinsic image artifacts for source camera attribution requires a structured image mining process. In this paper, we attempt to provide an introductory tutorial on the image processing pipeline, to determine the general classification of the features corresponding to different components for source camera attribution. The article also reviews techniques of the source camera attribution more comprehensively in the domain of the image forensics in conjunction with the presentation of classifying ongoing developments within the specified area. The classification of the existing source camera attribution approaches is presented based on the specific parameters, such as colour image processing pipeline, hardware- and software-related artifacts and the methods to extract such artifacts. The more recent source camera attribution approaches, which have not yet gained sufficient attention among image forensics researchers, are also critically analysed and further categorised into four different classes, namely, optical aberrations based, sensor camera fingerprints based, processing statistics based and processing regularities based, to present a classification. Furthermore, this paper aims to investigate the challenging problems, and the proposed strategies of such schemes based on the suggested taxonomy to plot an evolution of the source camera attribution approaches with respect to the subjective optimisation criteria over the last decade. The optimisation criteria were determined based on the strategies proposed to increase the detection accuracy, robustness and computational efficiency of source camera brand, model or device attribution.
    Matched MeSH terms: Data Mining
  20. Nur Azlina Abd Rahman, Muhamad Arifpin Mansor, Ahmad Rasdan Ismail
    MyJurnal
    The occurrences of occupational accidents and incidents are increasing in parallel with the growth of industries
    such as mining and quarrying. The main objective of this study was to analyze data on the perception of occupational
    accidents in the mining and quarrying sector in Malaysia. The data was collected and examined based on the
    questionnaires on the level of perception of accident investigation in mining and quarrying sector. Statistical data
    reported by the Department of Occupational Safety and Health (DOSH) was also reviewed. The findings of this study
    prove that the level of perception of workers towards occupational accident issues in mining and quarrying sector
    is still in the moderate level with the mean value of 3.28. The findings show that 51.7% of the workers agree while
    25.9% totally agree to the accident occurrence. Only 1.7% of the workers are not aware of accident occurrence at the
    workplace. Employers and employees must carry out their responsibilities to prevent accidents by adhering to health
    and safety practices at the workplace.
    Matched MeSH terms: Mining
Filters
Contact Us

Please provide feedback to Administrator (afdal@afpm.org.my)

External Links