3 resultados para lexical decision
em Cochin University of Science
Resumo:
This study is focussed on public and private sector The study is confined to industrial Public companies in the states of Kerala and Orissa along with companies in India. undertakings only. sector and private sector private sector companies in other states were studied. Even though the original plan of 190 companies as the sample size could not be accomplished, as the responses were very poor, but data could be collected frmn 6 public and 5 private sector companies in Kerala, 8 public and 8 private sector companies in Orissa along with 27 private sector companies in other states totalling to 54 companies. The number of years of data collected varies from 2 years to 6 years. Factors which are affecting capital expenditures and hence leading to the performance of private sector compared to public sector companies are studied. After the study and analysis, comparisons are made between public sector and private sector, and suitable recomendations are made so that public sector industries can also perform equally well as the private sector industries in India.
Resumo:
Decision trees are very powerful tools for classification in data mining tasks that involves different types of attributes. When coming to handling numeric data sets, usually they are converted first to categorical types and then classified using information gain concepts. Information gain is a very popular and useful concept which tells you, whether any benefit occurs after splitting with a given attribute as far as information content is concerned. But this process is computationally intensive for large data sets. Also popular decision tree algorithms like ID3 cannot handle numeric data sets. This paper proposes statistical variance as an alternative to information gain as well as statistical mean to split attributes in completely numerical data sets. The new algorithm has been proved to be competent with respect to its information gain counterpart C4.5 and competent with many existing decision tree algorithms against the standard UCI benchmarking datasets using the ANOVA test in statistics. The specific advantages of this proposed new algorithm are that it avoids the computational overhead of information gain computation for large data sets with many attributes, as well as it avoids the conversion to categorical data from huge numeric data sets which also is a time consuming task. So as a summary, huge numeric datasets can be directly submitted to this algorithm without any attribute mappings or information gain computations. It also blends the two closely related fields statistics and data mining
Resumo:
This paper highlights the prediction of Learning Disabilities (LD) in school-age children using two classification methods, Support Vector Machine (SVM) and Decision Tree (DT), with an emphasis on applications of data mining. About 10% of children enrolled in school have a learning disability. Learning disability prediction in school age children is a very complicated task because it tends to be identified in elementary school where there is no one sign to be identified. By using any of the two classification methods, SVM and DT, we can easily and accurately predict LD in any child. Also, we can determine the merits and demerits of these two classifiers and the best one can be selected for the use in the relevant field. In this study, Sequential Minimal Optimization (SMO) algorithm is used in performing SVM and J48 algorithm is used in constructing decision trees.