ANALYSIS OF MESENCHYMAL STEM CELL DIFFERENTIATION IN VITRO USING CLASSIFICATION ASSOCIATION RULE MINING

2009 ◽  
Vol 07 (06) ◽  
pp. 905-930 ◽  
Author(s):  
WEIQI WANG ◽  
YANBO JUSTIN WANG ◽  
RENÉ BAÑARES-ALCÁNTARA ◽  
FRANS COENEN ◽  
ZHANFENG CUI
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Stem Cell Differentiation ◽  
Rule Mining ◽  
Data Mining Technique ◽  
Web Based ◽  
Mesenchymal Stem Cell Differentiation ◽  
Classification Prediction

In this paper, data mining is used to analyze the data on the differentiation of mammalian Mesenchymal Stem Cells (MSCs), aiming at discovering known and hidden rules governing MSC differentiation, following the establishment of a web-based public database containing experimental data on the MSC proliferation and differentiation. To this effect, a web-based public interactive database comprising the key parameters which influence the fate and destiny of mammalian MSCs has been constructed and analyzed using Classification Association Rule Mining (CARM) as a data-mining technique. The results show that the proposed approach is technically feasible and performs well with respect to the accuracy of (classification) prediction. Key rules mined from the constructed MSC database are consistent with experimental observations, indicating the validity of the method developed and the first step in the application of data mining to the study of MSCs.

scholarly journals Privacy preserving association rule hiding using border based approach

2021 ◽  
Vol 23 (2) ◽  
pp. 1137
Author(s):  
Suma B. ◽  
Shobha G.
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Sensitive Information ◽  
Rule Mining ◽  
Data Mining Technique ◽  
Large Databases ◽  
Hidden Correlations ◽  
Rule Set

<div>Association rule mining is a well-known data mining technique used for extracting hidden correlations between data items in large databases. In the majority of the situations, data mining results contain sensitive information about individuals and publishing such data will violate individual secrecy. The challenge of association rule mining is to preserve the confidentiality of sensitive rules when releasing the database to external parties. The association rule hiding technique conceals the knowledge extracted by the sensitive association rules by modifying the database. In this paper, we introduce a border-based algorithm for hiding sensitive association rules. The main purpose of this approach is to conceal the sensitive rule set while maintaining the utility of the database and association rule mining results at the highest level. The performance of the algorithm in terms of the side effects is demonstrated using experiments conducted on two real datasets. The results show that the information loss is minimized without sacrificing the accuracy. </div>

scholarly journals An improved association rule mining algorithm for large data

2021 ◽  
Vol 30 (1) ◽  
pp. 750-762
Author(s):  
Zhenyi Zhao ◽  
Zhou Jian ◽  
Gurjot Singh Gaba ◽  
Roobaea Alroobaea ◽  
Mehedi Masud ◽  
...  
Keyword(s):  
Data Mining ◽  
Data Storage ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rapid Development ◽  
Large Data ◽  
Rule Mining ◽  
Data Mining Technique ◽  
Mining Technology ◽  
Database Technology

Abstract The data with the advancement of information technology are increasing on daily basis. The data mining technique has been applied to various fields. The complexity and execution time are the major factors viewed in existing data mining techniques. With the rapid development of database technology, many data storage increases, and data mining technology has become more and more important and expanded to various fields in recent years. Association rule mining is the most active research technique of data mining. Data mining technology is used for potentially useful information extraction and knowledge from big data sets. The results demonstrate that the precision ratio of the presented technique is high comparable to other existing techniques with the same recall rate, i.e., the R-tree algorithm. The proposed technique by the mining effectively controls the noise data, and the precision rate is also kept very high, which indicates the highest accuracy of the technique. This article makes a systematic and detailed analysis of data mining technology by using the Apriori algorithm.

An Enhanced Fuzzy ARM Approach for Intrusion Detection

2011 ◽  
Vol 3 (2) ◽  
pp. 41-61 ◽  
Author(s):  
Nasser S. Abouzakhar ◽  
Huankai Chen ◽  
Bruce Christianson
Keyword(s):  
Data Mining ◽  
Fuzzy Logic ◽  
Intrusion Detection ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Data Mining Technique ◽  
Detection Model ◽  
Improved Algorithm

The integration of fuzzy logic with data mining methods such as association rules has achieved interesting results in various digital forensics applications. As a data mining technique, the association rule mining (ARM) algorithm uses ranges to convert any quantitative features into categorical ones. Such features lead to the sudden boundary problem, which can be smoothed by incorporating fuzzy logic so as to develop interesting patterns for intrusion detection. This paper introduces a Fuzzy ARM-based intrusion detection model that is tested on the CAIDA 2007 backscatter network traffic dataset. Moreover, the authors present an improved algorithm named Matrix Fuzzy ARM algorithm for mining fuzzy association rules. The experiments and results that are presented in this paper demonstrate the effectiveness of integrating fuzzy logic with association rule mining in intrusion detection. The performance of the developed detection model is improved by using this integrated approach and improved algorithm.

scholarly journals Present State-of-The-Art of Association Rule Mining Algorithms

2019 ◽  
Vol 9 (1) ◽  
pp. 6398-6405
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
State Of The Art ◽  
Synthetic Data ◽  
Data Sets ◽  
Evolutionary Analysis ◽  
Rule Mining ◽  
Transaction Database ◽  
Mining Algorithms

A Data mining is the method of extracting useful information from various repositories such as Relational Database, Transaction database, spatial database, Temporal and Time-series database, Data Warehouses, World Wide Web. Various functionalities of Data mining include Characterization and Discrimination, Classification and prediction, Association Rule Mining, Cluster analysis, Evolutionary analysis. Association Rule mining is one of the most important techniques of Data Mining, that aims at extracting interesting relationships within the data. In this paper we study various Association Rule mining algorithms, also compare them by using synthetic data sets, and we provide the results obtained from the experimental analysis

scholarly journals ASSOCIATION RULE MINING UNTUK MENINGKATKAN PROMOSI PRODUK ( STUDI KASUS PADA PD. XYZ )

2018 ◽  
Vol 7 (2) ◽  
pp. 284-288
Author(s):  
Doni Winarso ◽  
Anwar Karnaidi
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining

Analisis association rule adalah teknik data mining yang digunakan untuk menemukan aturan asosiatif antara suatu kombinasi item. penelitian ini menggunakan algoritma apriori. Dengan  algoritma tersebut dilakukan pencarian  frekuensi dan item barang yang paling sering muncul. hasil dari penelitian in menunjukkan bahwa algoritma apriori  dapat digunakan untuk menganalisis data transaksi sehingga diketahui mana produk yang harus  dipromosikan. Perhitungan metode apriori menghasilkan suatu pola pembelian yang terjadi di PD. XYZ. dengan menganalisis pola tersebut dihasilakn kesimpulan bahwa produk  yang akan dipromosikan yaitu cat tembok ekonomis dan peralatan cat berupa kuas tangan dengan nilai support 11% dan confidence 75% .

Artificial Bee Colony-Based Associative Classifier for Healthcare Data Diagnosis

2021 ◽  
pp. 237-253
Author(s):  
M. Nandhini ◽  
S. N. Sivanandam ◽  
S. Renugadevi
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Artificial Bee Colony ◽  
Optimization Technique ◽  
Rule Mining ◽  
Healthcare Data ◽  
Bee Colony ◽  
Small Set ◽  
Significant Class

Data mining is likely to explore hidden patterns from the huge quantity of data and provides a way of analyzing and categorizing the data. Associative classification (AC) is an integration of two data mining tasks, association rule mining, and classification which is used to classify the unknown data. Though association rule mining techniques are successfully utilized to construct classifiers, it lacks in generating a small set of significant class association rules (CARs) to build an accurate associative classifier. In this work, an attempt is made to generate significant CARs using Artificial Bee Colony (ABC) algorithm, an optimization technique to construct an efficient associative classifier. Associative classifier, thus built using ABC discovered CARs achieve high prognostic accurateness and interestingness value. Promising results were provided by the ABC based AC when experiments were conducted using health care datasets from the UCI machine learning repository.

Constraint-Based Association Rule Mining

2011 ◽  
pp. 307-312 ◽  
Author(s):  
Carson Kai-Sang Leung
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Computational Cost ◽  
Knowledge Discovery In Databases ◽  
Rule Mining ◽  
The Subject ◽  
User Focus ◽  
High Computational Cost

The problem of association rule mining was introduced in 1993 (Agrawal et al., 1993). Since then, it has been the subject of numerous studies. Most of these studies focused on either performance issues or functionality issues. The former considered how to compute association rules efficiently, whereas the latter considered what kinds of rules to compute. Examples of the former include the Apriori-based mining framework (Agrawal & Srikant, 1994), its performance enhancements (Park et al., 1997; Leung et al., 2002), and the tree-based mining framework (Han et al., 2000); examples of the latter include extensions of the initial notion of association rules to other rules such as dependence rules (Silverstein et al., 1998) and ratio rules (Korn et al., 1998). In general, most of these studies basically considered the data mining exercise in isolation. They did not explore how data mining can interact with the human user, which is a key component in the broader picture of knowledge discovery in databases. Hence, they provided little or no support for user focus. Consequently, the user usually needs to wait for a long period of time to get numerous association rules, out of which only a small fraction may be interesting to the user. In other words, the user often incurs a high computational cost that is disproportionate to what he wants to get. This calls for constraint-based association rule mining.

Sign in / Sign up

Export Citation Format

Share Document