Title
Research history generation using maximum margin clustering of research papers based on metainformation
Abstract
Our research aim is the automatic generation of a researcher's research history from research articles published on the internet. Research history generation based on the k-Means clustering algorithm has been proposed in previous work. However, the performance of the k-Means algorithm is unsatisfactory. We propose a method based on Maximum Margin Clustering (MMC). MMC is a new clustering algorithm based on Support Vector Machines (SVM). It is known that MMC is better than existing clustering algorithms such as k-Means. In this paper, we describe how to convert articles into vectors using metainformation about them and how to decide an initial setting for MMC automatically. We demonstrate by experiment that the purity of a method based on MMC is about 0.58 and its entropy is about 0.415. This result is better than that achieved in previous work (purity: 0.35, entropy: 0.47).
Year
DOI
Venue
2011
10.1145/2095536.2095543
iiWAS
Keywords
Field
DocType
maximum margin,research history,research history generation,research paper,research article,research aim,automatic generation,k-means clustering algorithm,clustering algorithm,previous work,k-means algorithm,new clustering algorithm,k means clustering,k means,k means algorithm,clustering,support vector machine
k-medians clustering,Data mining,Fuzzy clustering,Canopy clustering algorithm,CURE data clustering algorithm,Clustering high-dimensional data,Data stream clustering,Correlation clustering,Computer science,Artificial intelligence,Cluster analysis,Machine learning
Conference
Citations 
PageRank 
References 
0
0.34
6
Authors
4
Name
Order
Citations
PageRank
Manh Cuong Nguyen1434.03
Daichi Kato210.72
Haruo Yokota3537302.44
Taiichi Hashimoto4354.88