|
AIML ISSN:
1687-4846 Print,
1687-4854 Online,
1687-4862 CD-ROM


|
@ARTICLE |
{P1121004977, |
| AUTHOR = |
{Alaa M. Elsayad}, |
| TITLE = |
{Diagnosis of Breast Tumor using Boosted Decision Trees}, |
| JOURNAL = |
{ICGST International Journal on Artificial Intelligence and Machine Learning, AIML}, |
| YEAR = |
{2010}, |
| MONTH= |
{October}, |
| VOLUME = |
{10}, |
| ISSUE = |
{I}, |
| PAGES= |
{1--11}, |
| ABSTRACT= |
{
Decision tree (DT) is one of the popular and effective data mining methods. DT provides a pathway to find “rules” that could be evaluated for separating the input samples into one of several groups without having to express the functional relationship directly. They avoid the limitations of the parametric models and are well suited for the analysis of nonlinear events. The purpose of this study is to examine the performance of the recent invented DT model algorithm (C5.0) on the diagnosis of breast cancer using cytologically proven tumor dataset . The objective is to classify a tumor as either benign or malignant based on cell descriptions gathered by microscopic examination. The classification performance of C5.0 DT is evaluated and compared to the one that achieved by radial basis function kernel support vector machine (RBF-SVM). The dataset has been partitioned by the ratio 70:30% into training and test subsets respectively . Experimental results show that the generalization of the C5.0 DT has been increased radically using boosting, winnowing and tree pruning methods. The C5.0 DT model has achieved a remarkable performance with 98.95% classification accuracy on training subset and 100% of test one while RBF-SVM has achieved 100% success on both training and test subsets}, |
| NOTE= |
{Breast cancer, cytology patterns, decision tree, support vector machine, performance measures }
} |
(Status:
Accepted)

| @ARTICLE |
{P1121002967, |
| AUTHOR = |
{Y. Mechqrane and R. Ezzahir and C. Bessiere and E.H. Bouyakhf}, |
| TITLE = |
{A Constraint Based Approach To Air Traffic Control}, |
| JOURNAL = |
{ICGST International Journal on Artificial Intelligence and Machine Learning, AIML}, |
| YEAR = |
{2010}, |
| MONTH= |
{October}, |
| VOLUME = |
{10}, |
| ISSUE = |
{I}, |
| PAGES= |
{13--22}, |
| ABSTRACT= |
{During the fly, a conflict between two aircraft occurs if the two aircraft are closer than a given safety distance. In this paper we propose a constraint based approach to solve conflicts between aircraft during the fly: Each pair of aircraft in the controlled airspace is related by a separation constraint which specifies that at any moment, the two aircraft must be separated by a minimum distance guaranteeing safety; the issue is to determine the maneuvers to be implemented by the pilots such that the separation constraints are satisfied. To this end, we discretized the time and used discrete variables and constraints. We formulated the separation constraints so that the number of tests required to check a constraint is independent of the time step. We also identified some useful properties of these constraints and used them to infer infeasible values during the search. Moreover, the filtering algorithm we used suspends forward checks until they are required by the search and avoids searching large domains for consistent values until it has to. These techniques save search efforts and reduce the computational times. In addition, to minimize the delays and additional consumption, "least- aggressive" maneuvers are tested first. Our approach make possible to solve difficult Air Traffic Control situations in a few seconds}, |
| NOTE= |
{Air traffic control, conflict resolution, constraint satisfaction problem, constraint propagation}
} |
(Status: Accepted)
|