Search Results - (( java application interface algorithm ) OR ( set generation mining algorithm ))

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

“…The experiments were conducted on self generated data sets (7 different sets) and well known datasets (Mushroom & Cars Data set). …”
Get full text
Get full text

Using unique-prime-factorization theorem to mine frequent patterns without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

“…For huge database it may need to generate a huge number of candidate sets. An interest solution is to design an approach that without generating candidate is able to mine frequent patterns. …”
Get full text
Get full text
Get full text

Frequent Lexicographic Algorithm for Mining Association Rules by Mustapha, Norwati

“…The mined frequent patterns are then used in generating association rules. …”
Get full text
Get full text

Propositional satisfiability algorithm to find minimal reducts for data mining by Bakar, A.A., Sulaiman, M.N., Othman, M., Selamat, M.H.

“…Reduct is a rough set approach in data mining that determines the set of important attributes to represent the IS. …”
Get full text
Get full text

A frequent pattern mining algorithm based on FP-growth without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

“…In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
Get full text
Get full text

A frequent pattern mining algorithm based on FP-growth without generating tree by Tohid, Hossein, Ibrahim, Hamidah

“…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
Get full text
Get full text
Get full text

Role Minimization As An Optimization Metric In Role Mining Algorithms : A Literature Review by Ahmad, Rabiah, Abd Hamid, Nazirah, Selamat, Siti Rahayu

“…A recent access control model that could accommodate a dynamic structure such as cloud computing can be recognized as role based access control and the role management process of this access control can be identified as role mining.The current trend in role based access control is the role mining problem that can be described as the difficulty to uncover an optimum set of roles from the userpermission assignment.To solve this problem,the researchers have proposed role mining algorithms to produce role set and among the existing algorithms there is an intrinsic topic of the common perception to evaluate the goodness of the generated role set.Eventually,the value of the identified roles could be measured by the preferred metric of optimality namely the number of roles,sizes of userassignment and permission-assignment and Weighted Structural Complexity.Until now, there is some disagreement on the optimization metric but notably many researchers have agreed on the minimization of the number of roles as a solid metric.This paper discusses an overview of the current state-of-the-art on the recent role mining algorithms that focus on role minimization as an optimization metric to evaluate the goodness of the identified roles. …”
Get full text
Get full text
Get full text

A numerical method for frequent pattern mining by Mustapha, Norwati, Nadimi-Shahraki, Mohammad-Hossein, Mamat, Ali, Sulaiman, Md. Nasir

“…Frequent pattern mining is one of the active research themes in data mining. …”
Get full text
Get full text

Exploratory analysis with association rule mining algorithms in the retail industry / Alaa Amin Hashad ... [et al.] by Hashad, Alaa Amin, Khaw, Khai Wah, Alnoor, Alhamzah, Chew, Xin Ying

“…To address this, missing customer IDs are filled with the last valid ID, assuming repeated purchases. The FP-Growth algorithm was found to be faster and more effective than the Apriori algorithm in extracting frequent item sets and generating association rules. …”
Get full text
Get full text

Comparative study of apriori-variant algorithms by Mutalib, Sofianita, Abdul Subar, Ammar Azri, Abdul Rahman, Shuzlina, Mohamed, Azlinah

“…However, the algorithm suffers from scanning time problem while generating candidates of frequent itemsets.This study presents a comparative study between several Apriori-variant algorithms and examines their scanning time.We performed experiments using several sets of different transactional data.The result shows that the improved Apriori algorithm manage to produce itemsets faster than the original Apriori algorithm.…”
Get full text
Get full text
Get full text

An enhancement of classification technique based on rough set theory for intrusion detection system application by Noor Suhana, Sulaiman

Get full text
Get full text

Evaluation of data mining models for predicting concrete strength by Wong, Chuan Ming

“…The Particle Swarm Optimization algorithm is able to generate optimal values for the concrete features that maximizes the strength of concrete. …”
Get full text
Get full text

Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

“…Total rules number, rules length and rules accuracy for the generation rules are recorded. The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
Get full text
Get full text

Discovering association rules for mining images datasets: a proposal by Hamzah, Azizi, O. K. Rahmat, Rahmita Wirza, Sulaiman, Md. Nasir

“…A synthetic image set containing geometric shapes will generate to test the initial algorithm implementation. …”
Get full text
Get full text

A Rough-Apriori Technique in Mining Linguistic Association Rules by Choo, Yun Huoy, Abu Bakar, Azuraliza, Hamdan, Abdul Razak

“…It uses the rough membership function to capture the linguistic interval before implementing the Apriori algorithm to mine interesting association rules. The performance of conventional quantitative association rules mining algorithm with Boolean reasoning as the discretization method was compared to the proposed technique and the fuzzy-based technique. …”
Get full text
Get full text
Get full text

DATA CLASSIFICATION SYSTEM WITH FUZZY NEURAL BASED APPROACH by LUONG, TRUNG TUAN

“…The project's objective is identifying the available data mining algorithms in data classification and applying new data mining algorithm to perform classification tasks. …”
Get full text
Get full text

Evaluation and optimization of frequent association rule based classification by Izwan Nizal Mohd Shaharanee, Jastini Jamil

“…Works on sustaining the interestingness of rules generated by data mining algorithms are actively and constantly being examined and developed. …”
Get full text
Get full text
Get full text

Genetic Algorithm for Web Data Mining by Loo, Kevin Teow Aik

“…By doing so, it could assist the process of data mining for information in the World Wide Web. This study used a prototype program based on genetic algorithm to manipulate the initial set of data. …”
Get full text
Get full text

Enhancing predictive crime mapping model using association rule mining for geographical and demographic structure by Asmai, S. A.

“…Apriori is a popular algorithm in finding frequent set of items in data and association rule. …”
Get full text
Get full text
Get full text

Evaluation and optimization of frequent, closed and maximal association rule based classification by Mohd Shaharanee, Izwan Nizal, Hadzic, Fedja

“…Real world applications of association rule mining have well-known problems of discovering a large number of rules, many of which are not interesting or useful for the application at hand.The algorithms for closed and maximal item sets mining significantly reduce the volume of rules discovered and complexity associated with the task, but the implications of their use and important differences with respect to the generalization power, precision and recall when used in the classification problem have not been examined.In this paper, we present a systematic evaluation of the association rules discovered from frequent, closed and maximal item set mining algorithms, combining common data mining and statistical interestingness measures, and outline an appropriate sequence of usage.The experiments are performed using a number of real-world datasets that represent diverse characteristics of data/items, and detailed evaluation of rule sets is provided as a whole and w.r.t individual classes. …”
Get full text
Get full text