Search Results - (( java implementation cell algorithm ) OR ( program tasks mining algorithm ))
Search alternatives:
- java implementation »
- implementation cell »
- mining algorithm »
- cell algorithm »
- program tasks »
- tasks mining »
-
1
Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining.
Published 2005“…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
Thesis -
2
Case Slicing Technique for Feature Selection
Published 2004“…Finding a good classification algorithm is an important component of many data mining projects. …”
Get full text
Get full text
Thesis -
3
-
4
An efficient and effective case classification method based on slicing
Published 2006“…This paper introduces a new classification method based on slicing techniques that was proposed for procedural programming languages. The paper also discusses two of common classification algorithms that are used either in data mining or in general AI. …”
Get full text
Get full text
Get full text
Article -
5
-
6
Towards a better feature subset selection approach
Published 2010“…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
A Machine Learning Classification Application to Identify Inefficient Novice Programmers
Published 2023Conference Paper -
8
-
9
Problem restructuring in interger programming for reduct searching
Published 2003“…In effect, they are very useful in generating rules when solving the classification problem that is inherent in data mining. The thesis emphasizes mainly on the improvement of the original SIP/DRIP algorithm in term of performance. …”
Get full text
Get full text
Thesis
