22nd International Conference on Advanced Information Networking and Applications - Workshops (Aina Workshops 2008) 2008
DOI: 10.1109/waina.2008.45
|View full text |Cite
|
Sign up to set email alerts
|

A Document Clustering Method Based on Hierarchical Algorithm with Model Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…We showed that the chord gap divergence centroid can be obtained using a convex-concave iterative procedure [7], and analyzed the k-means++ [31] performance by giving the Taylor-Lagrange forms of the skew Jensen and chord gap divergences. We expect our contributions to be useful for the signal processing, information fusion and machine learning communities where the Bhattacharrya [34,35] or Chernoff information [2,16] is often used. In practice, the triparametric chord gap divergence shall be tuned according to the application at hand (and the dataset for supervised tasks using cross-validation for example).…”
Section: Discussionmentioning
confidence: 99%
“…We showed that the chord gap divergence centroid can be obtained using a convex-concave iterative procedure [7], and analyzed the k-means++ [31] performance by giving the Taylor-Lagrange forms of the skew Jensen and chord gap divergences. We expect our contributions to be useful for the signal processing, information fusion and machine learning communities where the Bhattacharrya [34,35] or Chernoff information [2,16] is often used. In practice, the triparametric chord gap divergence shall be tuned according to the application at hand (and the dataset for supervised tasks using cross-validation for example).…”
Section: Discussionmentioning
confidence: 99%
“…A document clustering method based on hierarchical algorithm with model clustering is presented by Haojun et al, [12]. This paper involved in analyzing and making use of cluster overlapping technique to design cluster merging criterion.…”
Section: Related Workmentioning
confidence: 99%
“…There are two main categories of the document clustering algorithm that is Partitioned Clustering [6,7,8] and Hierarchical Clustering. Hierarchical clustering [10,11] Another clustering approach is the partitioned clustering algorithm, which creates one level partitioning of the document collection. K-means is an example of partitioned clustering algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…Mostly, the Agglomerative Hierarchical Clustering [10,11] and K-means clustering [6,7] cannot produce the effective results for clustering the documents. Some of the clustering algorithm produces the descriptive summaries that are not meaningful and readable which is difficult and reduces the search range.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation