Ankita Bose
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ankita Bose has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Kalyani Mali
University of Kalyani
2 shared publications- Kalyani Mali
University of Kalyani
2 shared publications - Kalyani Mali
University of Kalyani
1 shared publication
Latest Publications
- 24 November 2020
- Published by Springer Nature
- p. 443-454
An Artificial Bee Colony Inspired Density-Based Approach for Clustering with New Index Measure
- 24 November 2020
- Published by Springer Nature
- p. 443-454
An Artificial Bee Colony Inspired Density-Based Approach for Clustering with New Index Measure
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 42, 1-4
Artificial Bee Colony Inspired Density Based Clustering with efficient Parameter Selection
In this article, we have suggested an Artificial Bee Colony (ABC) inspired density based clustering. It can effectively deal with the issue of parameter selection as well as representation of varying densities of general density based clustering approaches. We plot the average density of the neighbours of each object in the data set. This unknown density distribution is then approximated using kernel density estimation. This helps us to identify the threshold, so that we can divide the density distribution of the data set into core and noise and we can also identify the cluster transitions. Including the parameter selection, the overall process is optimized using ABC. The superiority of the proposed approach has been delineated considering various data sets and by using different measurement techniques.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 42, 1-4
Artificial Bee Colony Inspired Density Based Clustering with efficient Parameter Selection
In this article, we have suggested an Artificial Bee Colony (ABC) inspired density based clustering. It can effectively deal with the issue of parameter selection as well as representation of varying densities of general density based clustering approaches. We plot the average density of the neighbours of each object in the data set. This unknown density distribution is then approximated using kernel density estimation. This helps us to identify the threshold, so that we can divide the density distribution of the data set into core and noise and we can also identify the cluster transitions. Including the parameter selection, the overall process is optimized using ABC. The superiority of the proposed approach has been delineated considering various data sets and by using different measurement techniques.
- 25 June 2019
- Published by Springer Nature
- p. 95-105
Gray Scale Image Segmentation with Vague Set
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 186-191
Clustering with vague set
This article constitutes a new method of clustering. The classical concept of fuzzy logic provides the means to represent approximate knowledge. Therefore the elements which lie in the boundaries of several sets are forced to belong to any of the sets. Introduction to fuzzy sets undoubtedly increases the computational burden, so there is an extension into shadowed sets, which takes the essence of fuzzy sets and reduce the computational complexity of the fuzzy sets. Shadowed set is based on three valued logic which represents the concept of full exclusion(0), full participation(1) and uncertain. So a shadowed set comprises of the elements with full participation in the set and those which are uncertain of this set. Here we have used another set theoretic concept named as vague set, it changes the general concept of fuzzy set and it removes the uncertainty of the shadowed set. Each object of this vague set has a grade of membership whose value is a continuous sub interval of [0,1]. In this study we have proposed a set theoretic concept which combines the concept of shadowed set as well as vague set. We use the proposed concept for the clustering of synthetic data sets and real data sets. The experimental results are analyzed by both quantitative and qualitative measures.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 186-191
Clustering with vague set
This article constitutes a new method of clustering. The classical concept of fuzzy logic provides the means to represent approximate knowledge. Therefore the elements which lie in the boundaries of several sets are forced to belong to any of the sets. Introduction to fuzzy sets undoubtedly increases the computational burden, so there is an extension into shadowed sets, which takes the essence of fuzzy sets and reduce the computational complexity of the fuzzy sets. Shadowed set is based on three valued logic which represents the concept of full exclusion(0), full participation(1) and uncertain. So a shadowed set comprises of the elements with full participation in the set and those which are uncertain of this set. Here we have used another set theoretic concept named as vague set, it changes the general concept of fuzzy set and it removes the uncertainty of the shadowed set. Each object of this vague set has a grade of membership whose value is a continuous sub interval of [0,1]. In this study we have proposed a set theoretic concept which combines the concept of shadowed set as well as vague set. We use the proposed concept for the clustering of synthetic data sets and real data sets. The experimental results are analyzed by both quantitative and qualitative measures.
- 2 February 2016
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 10 (6) , 1089-1096
Fuzzy-based artificial bee colony optimization for gray image segmentation
- 2 February 2016
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 10 (6) , 1089-1096
Fuzzy-based artificial bee colony optimization for gray image segmentation