Pub Date : 2018-05-07DOI: 10.4236/jilsa.2018.102003
J. A. C. Rocha, S. I. Martínez, J. L. Menchaca, J. D. T. Villanueva, M. G. T. Berrones, J. P. Cobos, D. U. Agundis
Many researchers around the world are looking for developing techniques or technologies that cover traditional and recent constraints in urban traffic con-trol. Normally, such traffic devices are facing with a large scale of input data when they must to response in a reliable, suitable and fast way. Because of such statement, the paper is devoted to introduce a proposal for enhancing the traffic light decisions. The principal goal is that a semaphore can provide a correct and fluent vehicular mobility. However, the traditional semaphore operative ways are outdated. We present in a previous contribution the development of a methodology capable of improving the vehicular mobility by proposing a new green light interval based on road conditions with a CBR approach. However, this proposal should include whether it is needed to modify such light duration. To do this, the paper proposes the adaptation of a fuzzy inference system helping to decide when the semaphore should try to fix the green light interval according to specific road requirements. Some experiments are conducted in a simulated environment to evaluate the pertinence of implementing a decision-making before the CBR methodology. For example, using a fuzzy inference approach the decisions of the system improve almost 18% in a set of 10,000 experiments. Finally, some conclusions are drawn to emphasize the benefits of including this technique in a methodology to implement intelligent semaphores.
{"title":"Fuzzy Rules to Improve Traffic Light Decisions in Urban Roads","authors":"J. A. C. Rocha, S. I. Martínez, J. L. Menchaca, J. D. T. Villanueva, M. G. T. Berrones, J. P. Cobos, D. U. Agundis","doi":"10.4236/jilsa.2018.102003","DOIUrl":"https://doi.org/10.4236/jilsa.2018.102003","url":null,"abstract":"Many researchers around the world are looking for developing techniques or technologies that cover traditional and recent constraints in urban traffic con-trol. Normally, such traffic devices are facing with a large scale of input data when they must to response in a reliable, suitable and fast way. Because of such statement, the paper is devoted to introduce a proposal for enhancing the traffic light decisions. The principal goal is that a semaphore can provide a correct and fluent vehicular mobility. However, the traditional semaphore operative ways are outdated. We present in a previous contribution the development of a methodology capable of improving the vehicular mobility by proposing a new green light interval based on road conditions with a CBR approach. However, this proposal should include whether it is needed to modify such light duration. To do this, the paper proposes the adaptation of a fuzzy inference system helping to decide when the semaphore should try to fix the green light interval according to specific road requirements. Some experiments are conducted in a simulated environment to evaluate the pertinence of implementing a decision-making before the CBR methodology. For example, using a fuzzy inference approach the decisions of the system improve almost 18% in a set of 10,000 experiments. Finally, some conclusions are drawn to emphasize the benefits of including this technique in a methodology to implement intelligent semaphores.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45733107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-07DOI: 10.4236/JILSA.2018.102002
Chunjie Zhou, Pengfei Dai, Zhenxing Zhang, Tong Liu
Estimating the cycle time of each job over event streams in intelligent manufacturing is critical. These streams include many long-lasting events which have certain durations. The temporal relationships among those interval-based events are often complex. Meanwhile, network latencies and machine failures in intelligent manufacturing may cause events to be out-of-order. This topic has rarely been discussed because most existing methods do not consider both interval-based and out-of-order events. In this work, we analyze the preliminaries of event temporal semantics. A tree-plan model of interval-based out-of-order events is proposed. A hybrid solution is correspondingly introduced. Extensive experimental studies demonstrate the efficiency of our approach.
{"title":"Interval-Based Out-of-Order Event Processing in Intelligent Manufacturing","authors":"Chunjie Zhou, Pengfei Dai, Zhenxing Zhang, Tong Liu","doi":"10.4236/JILSA.2018.102002","DOIUrl":"https://doi.org/10.4236/JILSA.2018.102002","url":null,"abstract":"Estimating the cycle time of each job over event streams in intelligent manufacturing is critical. These streams include many long-lasting events which have certain durations. The temporal relationships among those interval-based events are often complex. Meanwhile, network latencies and machine failures in intelligent manufacturing may cause events to be out-of-order. This topic has rarely been discussed because most existing methods do not consider both interval-based and out-of-order events. In this work, we analyze the preliminaries of event temporal semantics. A tree-plan model of interval-based out-of-order events is proposed. A hybrid solution is correspondingly introduced. Extensive experimental studies demonstrate the efficiency of our approach.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47618658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-03-20DOI: 10.4236/JILSA.2018.101001
F. Shen, Yugyung Lee
A large number of ontologies have been introduced by the biomedical community in recent years. Knowledge discovery for entity identification from ontology has become an important research area, and it is always interesting to discovery how associations are established to connect concepts in a single ontology or across multiple ontologies. However, due to the exponential growth of biomedical big data and their complicated associations, it becomes very challenging to detect key associations among entities in an inefficient dynamic manner. Therefore, there exists a gap between the increasing needs for association detection and large volume of biomedical ontologies. In this paper, to bridge this gap, we presented a knowledge discovery framework, the BioBroker, for grouping entities to facilitate the process of biomedical knowledge discovery in an intelligent way. Specifically, we developed an innovative knowledge discovery algorithm that combines a graph clustering method and an indexing technique to discovery knowledge patterns over a set of interlinked data sources in an efficient way. We have demonstrated capabilities of the BioBroker for query execution with a use case study on a subset of the Bio2RDF life science linked data.
{"title":"BioBroker: Knowledge Discovery Framework for Heterogeneous Biomedical Ontologies and Data","authors":"F. Shen, Yugyung Lee","doi":"10.4236/JILSA.2018.101001","DOIUrl":"https://doi.org/10.4236/JILSA.2018.101001","url":null,"abstract":"A large number of ontologies have been introduced by the biomedical community in recent years. Knowledge discovery for entity identification from ontology has become an important research area, and it is always interesting to discovery how associations are established to connect concepts in a single ontology or across multiple ontologies. However, due to the exponential growth of biomedical big data and their complicated associations, it becomes very challenging to detect key associations among entities in an inefficient dynamic manner. Therefore, there exists a gap between the increasing needs for association detection and large volume of biomedical ontologies. In this paper, to bridge this gap, we presented a knowledge discovery framework, the BioBroker, for grouping entities to facilitate the process of biomedical knowledge discovery in an intelligent way. Specifically, we developed an innovative knowledge discovery algorithm that combines a graph clustering method and an indexing technique to discovery knowledge patterns over a set of interlinked data sources in an efficient way. We have demonstrated capabilities of the BioBroker for query execution with a use case study on a subset of the Bio2RDF life science linked data.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43891812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-09-26DOI: 10.4236/JILSA.2017.94005
Qing-E Wu, Zhenyu Han, Qinge Wu
For better applications of fuzzy automata on target tracking, this paper presents an associated method of fuzzy automata by discussing the relation between fuzzy automata. The equivalence is mainly discussed regarding these fuzzy automata. The target tracking based on the associated method of fuzzy automata is given. Moreover, the simulation result shows that the associated method is better than single fuzzy automaton relatively. The development of these researches in this paper in turn can quicken the applications of the fuzzy automata in various fields.
{"title":"Application of Union of Fuzzy Automata on Target Tracking","authors":"Qing-E Wu, Zhenyu Han, Qinge Wu","doi":"10.4236/JILSA.2017.94005","DOIUrl":"https://doi.org/10.4236/JILSA.2017.94005","url":null,"abstract":"For better applications of fuzzy automata on target tracking, this paper presents an associated method of fuzzy automata by discussing the relation between fuzzy automata. The equivalence is mainly discussed regarding these fuzzy automata. The target tracking based on the associated method of fuzzy automata is given. Moreover, the simulation result shows that the associated method is better than single fuzzy automaton relatively. The development of these researches in this paper in turn can quicken the applications of the fuzzy automata in various fields.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44377650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-09-26DOI: 10.4236/JILSA.2017.94006
Areej Alsaafin, Ashraf Elnagar
Many systems of handwritten digit recognition built using the complete set of features in order to enhance the accuracy. However, these systems lagged in terms of time and memory. These two issues are very critical issues especially for real time applications. Therefore, using Feature Selection (FS) with suitable machine learning technique for digit recognition contributes to facilitate solving the issues of time and memory by minimizing the number of features used to train the model. This paper examines various FS methods with several classification techniques using MNIST dataset. In addition, models of different algorithms (i.e. linear, non-linear, ensemble, and deep learning) are implemented and compared in order to study their suitability for digit recognition. The objective of this study is to identify a subset of relevant features that provides at least the same accuracy as the complete set of features in addition to reducing the required time, computational complexity, and required storage for digit recognition. The experimental results proved that 60% of the complete set of features reduces the training time up to third of the required time using the complete set of features. Moreover, the classifiers trained using the proposed subset achieve the same accuracy as the classifiers trained using the complete set of features.
{"title":"A Minimal Subset of Features Using Feature Selection for Handwritten Digit Recognition","authors":"Areej Alsaafin, Ashraf Elnagar","doi":"10.4236/JILSA.2017.94006","DOIUrl":"https://doi.org/10.4236/JILSA.2017.94006","url":null,"abstract":"Many systems of handwritten digit recognition built using the complete set of features in order to enhance the accuracy. However, these systems lagged in terms of time and memory. These two issues are very critical issues especially for real time applications. Therefore, using Feature Selection (FS) with suitable machine learning technique for digit recognition contributes to facilitate solving the issues of time and memory by minimizing the number of features used to train the model. This paper examines various FS methods with several classification techniques using MNIST dataset. In addition, models of different algorithms (i.e. linear, non-linear, ensemble, and deep learning) are implemented and compared in order to study their suitability for digit recognition. The objective of this study is to identify a subset of relevant features that provides at least the same accuracy as the complete set of features in addition to reducing the required time, computational complexity, and required storage for digit recognition. The experimental results proved that 60% of the complete set of features reduces the training time up to third of the required time using the complete set of features. Moreover, the classifiers trained using the proposed subset achieve the same accuracy as the classifiers trained using the complete set of features.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46188246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-08-23DOI: 10.4236/JILSA.2017.93004
V. Shats
The paper proposes a solution to the problem classification by calculating the sequence of matrices of feature indices that approximate invariants of the data matrix. Here the feature index is the index of interval for feature values, and the number of intervals is a parameter. Objects with the equal indices form granules, including information granules, which correspond to the objects of the training sample of a certain class. From the ratios of the information granules lengths, we obtain the frequency intervals of any feature that are the same for the appropriate objects of the control sample. Then, for an arbitrary object, we find object probability estimation in each class and then the class of object that corresponds to the maximum probability. For a sequence of the parameter values, we find a converging sequence of error rates. An additional effect is created by the parameters aimed at increasing the data variety and compressing rare data. The high accuracy and stability of the results obtained using this method have been confirmed for nine data set from the UCI repository. The proposed method has obvious advantages over existing ones due to the algorithm’s simplicity and universality, as well as the accuracy of the solutions.
{"title":"Classification Based on Invariants of the Data Matrix","authors":"V. Shats","doi":"10.4236/JILSA.2017.93004","DOIUrl":"https://doi.org/10.4236/JILSA.2017.93004","url":null,"abstract":"The paper proposes a solution to the problem classification by calculating the sequence of matrices of feature indices that approximate invariants of the data matrix. Here the feature index is the index of interval for feature values, and the number of intervals is a parameter. Objects with the equal indices form granules, including information granules, which correspond to the objects of the training sample of a certain class. From the ratios of the information granules lengths, we obtain the frequency intervals of any feature that are the same for the appropriate objects of the control sample. Then, for an arbitrary object, we find object probability estimation in each class and then the class of object that corresponds to the maximum probability. For a sequence of the parameter values, we find a converging sequence of error rates. An additional effect is created by the parameters aimed at increasing the data variety and compressing rare data. The high accuracy and stability of the results obtained using this method have been confirmed for nine data set from the UCI repository. The proposed method has obvious advantages over existing ones due to the algorithm’s simplicity and universality, as well as the accuracy of the solutions.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45631676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-05-12DOI: 10.4236/JILSA.2017.92003
H. A. Khan
Digit Recognition is an essential element of the process of scanning and converting documents into electronic format. In this work, a new Multiple-Cell Size (MCS) approach is being proposed for utilizing Histogram of Oriented Gradient (HOG) features and a Support Vector Machine (SVM) based classifier for efficient classification of Handwritten Digits. The HOG based technique is sensitive to the cell size selection used in the relevant feature extraction computations. Hence a new MCS approach has been used to perform HOG analysis and compute the HOG features. The system has been tested on the Benchmark MNIST Digit Database of handwritten digits and a classification accuracy of 99.36% has been achieved using an Independent Test set strategy. A Cross-Validation analysis of the classification system has also been performed using the 10-Fold Cross-Validation strategy and a 10-Fold classification accuracy of 99.26% has been obtained. The classification performance of the proposed system is superior to existing techniques using complex procedures since it has achieved at par or better results using simple operations in both the Feature Space and in the Classifier Space. The plots of the system’s Confusion Matrix and the Receiver Operating Characteristics (ROC) show evidence of the superior performance of the proposed new MCS HOG and SVM based digit classification system.
{"title":"MCS HOG Features and SVM Based Handwritten Digit Recognition System","authors":"H. A. Khan","doi":"10.4236/JILSA.2017.92003","DOIUrl":"https://doi.org/10.4236/JILSA.2017.92003","url":null,"abstract":"Digit Recognition is an essential element of the process of scanning and converting documents into electronic format. In this work, a new Multiple-Cell Size (MCS) approach is being proposed for utilizing Histogram of Oriented Gradient (HOG) features and a Support Vector Machine (SVM) based classifier for efficient classification of Handwritten Digits. The HOG based technique is sensitive to the cell size selection used in the relevant feature extraction computations. Hence a new MCS approach has been used to perform HOG analysis and compute the HOG features. The system has been tested on the Benchmark MNIST Digit Database of handwritten digits and a classification accuracy of 99.36% has been achieved using an Independent Test set strategy. A Cross-Validation analysis of the classification system has also been performed using the 10-Fold Cross-Validation strategy and a 10-Fold classification accuracy of 99.26% has been obtained. The classification performance of the proposed system is superior to existing techniques using complex procedures since it has achieved at par or better results using simple operations in both the Feature Space and in the Classifier Space. The plots of the system’s Confusion Matrix and the Receiver Operating Characteristics (ROC) show evidence of the superior performance of the proposed new MCS HOG and SVM based digit classification system.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46676772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-24DOI: 10.4236/JILSA.2017.91001
M. Fatima, M. Pasha
In medical imaging, Computer Aided Diagnosis (CAD) is a rapidly growing dynamic area of research. In recent years, significant attempts are made for the enhancement of computer aided diagnosis applications because errors in medical diagnostic systems can result in seriously misleading medical treatments. Machine learning is important in Computer Aided Diagnosis. After using an easy equation, objects such as organs may not be indicated accurately. So, pattern recognition fundamentally involves learning from examples. In the field of bio-medical, pattern recognition and machine learning promise the improved accuracy of perception and diagnosis of disease. They also promote the objectivity of decision-making process. For the analysis of high-dimensional and multimodal bio-medical data, machine learning offers a worthy approach for making classy and automatic algorithms. This survey paper provides the comparative analysis of different machine learning algorithms for diagnosis of different diseases such as heart disease, diabetes disease, liver disease, dengue disease and hepatitis disease. It brings attention towards the suite of machine learning algorithms and tools that are used for the analysis of diseases and decision-making process accordingly.
{"title":"Survey of Machine Learning Algorithms for Disease Diagnostic","authors":"M. Fatima, M. Pasha","doi":"10.4236/JILSA.2017.91001","DOIUrl":"https://doi.org/10.4236/JILSA.2017.91001","url":null,"abstract":"In medical imaging, Computer Aided Diagnosis (CAD) is a rapidly growing dynamic area of research. In recent years, significant attempts are made for the enhancement of computer aided diagnosis applications because errors in medical diagnostic systems can result in seriously misleading medical treatments. Machine learning is important in Computer Aided Diagnosis. After using an easy equation, objects such as organs may not be indicated accurately. So, pattern recognition fundamentally involves learning from examples. In the field of bio-medical, pattern recognition and machine learning promise the improved accuracy of perception and diagnosis of disease. They also promote the objectivity of decision-making process. For the analysis of high-dimensional and multimodal bio-medical data, machine learning offers a worthy approach for making classy and automatic algorithms. This survey paper provides the comparative analysis of different machine learning algorithms for diagnosis of different diseases such as heart disease, diabetes disease, liver disease, dengue disease and hepatitis disease. It brings attention towards the suite of machine learning algorithms and tools that are used for the analysis of diseases and decision-making process accordingly.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43470925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-24DOI: 10.4236/JILSA.2017.91002
M. A. Razek, C. Frasson
Nowadays, millions of users use many social media systems every day. These services produce massive messages, which play a vital role in the social networking paradigm. As we see, an intelligent learning emotion system is desperately needed for detecting emotion among these messages. This system could be suitable in understanding users’ feelings towards particular discussion. This paper proposes a text-based emotion recognition approach that uses personal text data to recognize user’s current emotion. The proposed approach applies Dominant Meaning Technique to recognize user’s emotion. The paper reports promising experiential results on the tested dataset based on the proposed algorithm.
{"title":"Text-Based Intelligent Learning Emotion System","authors":"M. A. Razek, C. Frasson","doi":"10.4236/JILSA.2017.91002","DOIUrl":"https://doi.org/10.4236/JILSA.2017.91002","url":null,"abstract":"Nowadays, millions of users use many social media systems every day. These services produce massive messages, which play a vital role in the social networking paradigm. As we see, an intelligent learning emotion system is desperately needed for detecting emotion among these messages. This system could be suitable in understanding users’ feelings towards particular discussion. This paper proposes a text-based emotion recognition approach that uses personal text data to recognize user’s current emotion. The proposed approach applies Dominant Meaning Technique to recognize user’s emotion. The paper reports promising experiential results on the tested dataset based on the proposed algorithm.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48899241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-09-27DOI: 10.4236/JILSA.2016.84006
Kathirvalavakumar Thangairulappan, Arun Kanagavel
Automatic web page classification has become inevitable for web directories due to the multitude of web pages in the World Wide Web. In this paper an improved Term Weighting technique is proposed for automatic and effective classification of web pages. The web documents are represented as set of features. The proposed method selects and extracts the most prominent features reducing the high dimensionality problem of classifier. The proper selection of features among the large set improves the performance of the classifier. The proposed algorithm is implemented and tested on a benchmarked dataset. The results show the better performance than most of the existing term weighting techniques.
{"title":"Improved Term Weighting Technique for Automatic Web Page Classification","authors":"Kathirvalavakumar Thangairulappan, Arun Kanagavel","doi":"10.4236/JILSA.2016.84006","DOIUrl":"https://doi.org/10.4236/JILSA.2016.84006","url":null,"abstract":"Automatic web page classification has become inevitable for web directories due to the multitude of web pages in the World Wide Web. In this paper an improved Term Weighting technique is proposed for automatic and effective classification of web pages. The web documents are represented as set of features. The proposed method selects and extracts the most prominent features reducing the high dimensionality problem of classifier. The proper selection of features among the large set improves the performance of the classifier. The proposed algorithm is implemented and tested on a benchmarked dataset. The results show the better performance than most of the existing term weighting techniques.","PeriodicalId":69452,"journal":{"name":"智能学习系统与应用(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70330779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：