Efficient attribute selection strategies for association rule mining in high dimensional data

Author(s):  
M. Ramachandran Kaimal ◽  
Sandhya Harikumar ◽  
Divya Usha Dilipkumar
2018 ◽  
Vol 23 (3) ◽  
pp. 420-427 ◽  
Author(s):  
Dongmei Ai ◽  
Hongfei Pan ◽  
Xiaoxin Li ◽  
Yingxin Gao ◽  
Di He

SPE Journal ◽  
2016 ◽  
Vol 21 (06) ◽  
pp. 1996-2009 ◽  
Author(s):  
Satomi Suzuki ◽  
Dave Stern ◽  
Tom Manzocchi

Summary Because of computational advances in reservoir simulation with high-performance computing, it is now possible to simulate more than thousands of reservoir-simulation cases in a practical time frame. This opens a new avenue to reservoir-simulation studies, enabling exhaustive exploration of subsurface uncertainty and development/depletion options. However, analyzing the results of a large number of simulation cases still remains a challenging and overwhelming task. We propose a new method that enables the efficient analysis of massive reservoir-simulation results, often consisting of thousands of cases, by discovering interesting patterns of relationships among variables in large data sets. The method uses a well-known data-mining method, called association-rule mining, together with a high-dimensional visualization technique. We demonstrate the capability of the proposed method by using it to analyze the reservoir-simulation results from the Sensitivity Analysis of the Impact of Geological Uncertainty on Production (SAIGUP) project, which is an interdisciplinary reservoir-modeling project carried out earlier by Manzocchi et al. (2008a). To investigate the influence of geological features on oil recovery in shallow marine reservoirs, numerous reservoir models were built and flow-simulated in the SAIGUP project. In this paper, we analyze the simulation results from an ensemble of 9,072 models, which cover all possible combinations of several structural and sedimentological parameters individually varied to describe geological uncertainty. To be able to analyze the simulation results from such exhaustive sampling from high-dimensional model parameter space, it is crucial to efficiently decompose complex interactions between model parameters and to discover hidden impacts on flow response. By coupling the association-rule mining algorithm and high-dimensional visualization, such interactions and impacts are rapidly extracted and visualized in such a way that engineers and geoscientists can interpret meaningful sensitivities “at a glance.” This methodology provides a novel way to rapidly interpret flow response from a large ensemble of reservoir models without being overwhelmed by massive data.


Algorithms ◽  
2022 ◽  
Vol 15 (1) ◽  
pp. 21
Author(s):  
Consolata Gakii ◽  
Paul O. Mireji ◽  
Richard Rimiru

Analysis of high-dimensional data, with more features () than observations () (), places significant demand in cost and memory computational usage attributes. Feature selection can be used to reduce the dimensionality of the data. We used a graph-based approach, principal component analysis (PCA) and recursive feature elimination to select features for classification from RNAseq datasets from two lung cancer datasets. The selected features were discretized for association rule mining where support and lift were used to generate informative rules. Our results show that the graph-based feature selection improved the performance of sequential minimal optimization (SMO) and multilayer perceptron classifiers (MLP) in both datasets. In association rule mining, features selected using the graph-based approach outperformed the other two feature-selection techniques at a support of 0.5 and lift of 2. The non-redundant rules reflect the inherent relationships between features. Biological features are usually related to functions in living systems, a relationship that cannot be deduced by feature selection and classification alone. Therefore, the graph-based feature-selection approach combined with rule mining is a suitable way of selecting and finding associations between features in high-dimensional RNAseq data.


2015 ◽  
Vol 6 (2) ◽  
Author(s):  
Rizal Setya Perdana ◽  
Umi Laili Yuhana

Kualitas perangkat lunak merupakan salah satu penelitian pada bidangrekayasa perangkat lunak yang memiliki peranan yang cukup besar dalamterbangunnya sistem perangkat lunak yang berkualitas baik. Prediksi defectperangkat lunak yang disebabkan karena terdapat penyimpangan dari prosesspesifikasi atau sesuatu yang mungkin menyebabkan kegagalan dalam operasionaltelah lebih dari 30 tahun menjadi topik riset penelitian. Makalah ini akandifokuskan pada prediksi defect yang terjadi pada kode program (code defect).Metode penanganan permasalahan defect pada kode program akan memanfaatkanpola-pola kode perangkat lunak yang berpotensi menimbulkan defect pada data setNASA untuk memprediksi defect. Metode yang digunakan dalam pencarian polaadalah memanfaatkan Association Rule Mining dengan Cumulative SupportThresholds yang secara otomatis menghasilkan nilai support dan nilai confidencepaling optimal tanpa membutuhkan masukan dari pengguna. Hasil pengujian darihasil pemrediksian defect kode perangkat lunak secara otomatis memiliki nilaiakurasi 82,35%.


Sign in / Sign up

Export Citation Format

Share Document