Nonuniform Granularity-Based Classification in Social Interest Detection

Social interest detection is a new computing paradigm which processes a great variety of large scale resources. Effective classification of these resources is necessary for the social interest detection. In this paper, we describe some concepts and principles about classification and present a novel...

Full description

Saved in:
Bibliographic Details
Published inMathematical problems in engineering Vol. 2017; no. 2017; pp. 1 - 10
Main Authors Huang, Liaoruo, Jin, Xianli, Shen, Qingguo, Shao, Wenjuan, Chen, Jingjing
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 01.01.2017
Hindawi
Hindawi Limited
Subjects
Algorithms
Artificial intelligence
Automation
Charts
Classification
Cluster analysis
Clustering
Effectiveness
Mathematical problems
Set theory
Social networks
Text categorization
Online AccessGet full text

Cover

More Information
Summary:Social interest detection is a new computing paradigm which processes a great variety of large scale resources. Effective classification of these resources is necessary for the social interest detection. In this paper, we describe some concepts and principles about classification and present a novel classification algorithm based on nonuniform granularity. Clustering algorithm is used to generate a clustering pedigree chart. By using suitable classification cutting values to cut the chart, we can get different branches which are used as categories. The size of cutting value is vital to the performance and can be dynamically adapted in the proposed algorithm. Experiments results carried on the blog posts illustrate the effectiveness of the proposed algorithm. Furthermore, the results for comparing with Naive Bayes, k-nearest neighbor, and so forth validate the better classification performance of the proposed algorithm for large scale resources.
ISSN:1024-123X
1563-5147
DOI:10.1155/2017/5054825