DOI: 10.1007/978-0-387-09695-7_8
|View full text |Cite
|
Sign up to set email alerts
|

P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction

Abstract: Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unseen data. Alternative algorithms have been developed such as the Prism algorithm. Prism constructs modular rules which produce qualitatively better rules than rules induced by TDIDT. However, along with the increasing size of databases, many existing rule learning algorithms have proved to be computational expensive on large datasets.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…Another version namely N-PRISM algorithm (Bramer, 2000) is proposed to resolve the problem of noisy data, whereas J-Pruning (Bramer, 2002) employs pre-pruning strategy. In 2008, Stahl and Barmer introduced Parallel PRISM (P-PRISM) (Stahl and Bramer, 2008) method to overcome PRISM’s excessive computational process of testing the entire population of data attribute inside the training data set.…”
Section: Background Of the Present Researchmentioning
confidence: 99%
“…Another version namely N-PRISM algorithm (Bramer, 2000) is proposed to resolve the problem of noisy data, whereas J-Pruning (Bramer, 2002) employs pre-pruning strategy. In 2008, Stahl and Barmer introduced Parallel PRISM (P-PRISM) (Stahl and Bramer, 2008) method to overcome PRISM’s excessive computational process of testing the entire population of data attribute inside the training data set.…”
Section: Background Of the Present Researchmentioning
confidence: 99%
“…The authors developed a strategy for parallel RI called Parallel Modular Classification Rule Induction (PMCRI). This strategy is a continuation of an early work by the same authors in 2008 which resulted in parallel PRISM (P-PRISM) (Stahl and Bramer, 2008). P-PRISM algorithm was disseminated to overcome PRISM's excessive computational process of testing the entire population of data attribute inside the training dataset.…”
Section: Prism Consmentioning
confidence: 99%
“…(Stahl and Bramer, 2008) (Elgibreen and Aksoy, 2013) (Stahl and Bramer, 2014). This algorithm employs separate-and-conquer strategy in knowledge discovery in which PRISM generates rules according to the class labels in the training dataset.…”
Section: Introductionmentioning
confidence: 99%
“…The final concept description in the case of classification rule induction would be a set of classification rules. We developed a parallel modular classification rule induction framework for the Prism family and tested it on PrismTCS, the PMCRI (Parallel Modular Classification Rule Induction) framework [21], which applies to the CDM model. Parallelisation in the first layer is achieved by distributing all attribute lists evenly over n processors and processing them locally by algorithms L 1 to L n , which induce rule terms.…”
Section: Pmcri: a Parallel Modular Classification Rule Induction Frammentioning
confidence: 99%