Leveraging Incrementally Enriched Domain Knowledge to Enhance Service Categorization

2012 ◽  
Vol 9 (3) ◽  
pp. 43-66 ◽  
Author(s):  
Jia Zhang ◽  
Jian Wang ◽  
Patrick Hung ◽  
Zheng Li ◽  
Neng Zhang ◽  
...  

This paper reports the authors’ study over an open service and mashup repository, ProgrammableWeb, which groups stored services into predefined categories. Leveraging such a unique structural feature and hidden domain knowledge of the service repository, they extend the Support Vector Machine (SVM)-based text classification technique to enhance service-oriented categorization. An iterative approach is presented to automatically verify and adjust service categorization, which will incrementally enrich domain ontology and in turn enhance the accuracy of service categorization.

2021 ◽  
Vol 19 ◽  
pp. 528-533
Author(s):  
Rongzhen Qi ◽  
◽  
Olga Zyabkina ◽  
Daniel Agudelo Martinez ◽  
Jan Meyer

This paper presents a comprehensive framework for voltage notch analysis and an automatic method for notch detection using a nonlinear support vector machine (SVM) classifier. A comprehensive simulation of the notch disturbance has been conducted to generate a diverse database. Based on domain knowledge and properties of power quality disturbances (PQDs), a set of characteristic features is extracted. After feature extraction, a set of most descriptive features has been selected with decision tree (DT) algorithm, and a nonlinear SVM classifier has been trained. Finally, the detection efficiency of the trained model is presented and discussed.


2019 ◽  
Vol 47 (3) ◽  
pp. 154-170
Author(s):  
Janani Balakumar ◽  
S. Vijayarani Mohan

Purpose Owing to the huge volume of documents available on the internet, text classification becomes a necessary task to handle these documents. To achieve optimal text classification results, feature selection, an important stage, is used to curtail the dimensionality of text documents by choosing suitable features. The main purpose of this research work is to classify the personal computer documents based on their content. Design/methodology/approach This paper proposes a new algorithm for feature selection based on artificial bee colony (ABCFS) to enhance the text classification accuracy. The proposed algorithm (ABCFS) is scrutinized with the real and benchmark data sets, which is contrary to the other existing feature selection approaches such as information gain and χ2 statistic. To justify the efficiency of the proposed algorithm, the support vector machine (SVM) and improved SVM classifier are used in this paper. Findings The experiment was conducted on real and benchmark data sets. The real data set was collected in the form of documents that were stored in the personal computer, and the benchmark data set was collected from Reuters and 20 Newsgroups corpus. The results prove the performance of the proposed feature selection algorithm by enhancing the text document classification accuracy. Originality/value This paper proposes a new ABCFS algorithm for feature selection, evaluates the efficiency of the ABCFS algorithm and improves the support vector machine. In this paper, the ABCFS algorithm is used to select the features from text (unstructured) documents. Although, there is no text feature selection algorithm in the existing work, the ABCFS algorithm is used to select the data (structured) features. The proposed algorithm will classify the documents automatically based on their content.


2008 ◽  
Author(s):  
Sung-Huai Hsieh ◽  
Sheau-Ling Hsieh ◽  
Yin-Hsiu Chien ◽  
Zhenyu Wang ◽  
Yung-Ching Weng ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document