# Efficiency analysis of kernel functions in uncertainty based c-means algorithms

^{1}

##### Citations

1,758 citations

^{1}

8 citations

8 citations

5 citations

### Additional excerpts

...It has been clearly seen that the hypertangent kernel performs better than other kernels when applied to a large dataset (Mittal and Tripathy 2015). x; við Þ ¼ 1 tanh jjx vijj2 r2 ð4Þ...

[...]

4 citations

##### References

13,376 citations

6,757 citations

### "Efficiency analysis of kernel funct..." refers background or methods in this paper

...The dataset for experimentation was gathered from UCI machine learning repository, evaluations have been performed over synthetic, user modeling and human 807978-1-4799-8792-4/15/$31.00 c©2015 IEEE activity recognition datasets....

[...]

...It is given by following formula = ≠ )(max ),( minmin ll ki iki mS mmd Dunn (7) where 1 i, k, l C C denotes the total number of clusters, m denotes the centroid and S(mi) denotes the within cluster distance that can be found independently for each algorithm....

[...]

5,787 citations

### "Efficiency analysis of kernel funct..." refers background or methods in this paper

...The dataset for experimentation was gathered from UCI machine learning repository, evaluations have been performed over synthetic, user modeling and human 807978-1-4799-8792-4/15/$31.00 c©2015 IEEE activity recognition datasets....

[...]

...It is given by following formula = ≠ )(max ),( minmin ll ki iki mS mmd Dunn (7) where 1 i, k, l C C denotes the total number of clusters, m denotes the centroid and S(mi) denotes the within cluster distance that can be found independently for each algorithm....

[...]

5,254 citations

2,452 citations