Clustering by fast search and find of density peaks (CFSFDP) was proposed to create clusters by finding high-density peaks, quickly. CFSFDP mainly based on two rules: 1) a cluster center has a high dense point and 2) a cluster center lies at a large distance from other clusters centers. The effectiveness of CFSFDP highly depends upon the cutoff distance (Cd), which is used to estimate the density of each data point. However, there is a need to provide the predefined Cd. In this paper, we propose an adaptive way to estimate the accurate Cd by using the characteristics of Improved Sheather-Jones (ISJ) method named as IJS-CFSFDP. ISJ method provides the best estimation for Cd to measure accurate density of each data point. We perform a number of experiments on standard benchmark clustering datasets and real academic dataset of students. The evaluated clustering results on education dataset validate the IJS-CFSFDP can be used to make intelligent contents delivery system based on the capability and intelligence of the student. The experimental results on synthetic datasets show that the proposed adaptive Cd method creates better clusters as compare to the CFSFDP, mean shift, affinity propagation and k-means.
LiY., FengS., ZhangX. and JiaoL., SAR image segmentation based on quantum-inspired multiobjective evolutionary clustering algorithm, Information Processing Letters114(6) (2014), 287–293.
2.
LuJ. and TanY.-P., Uncorrelated discriminant simplex analysis for view-invariant gaitsignal computing, Pattern Recognition Letters31(5) (2010), 382–393.
3.
LuJ. and ZhangE., Gait recognition for human identification based on ICA and fuzzy SVM through multiple views fusion, Pattern Recognition Letters28(16) (2007), 2401–2411.
4.
Jones KristenM. and
LacyM., Measuring the clustering around normal and dust-obscured quasars at 2 in the spitzer extragalactic representative volume survey (SERVS),, In American Astronomical Society Meeting Abstracts223(223) (2014).
5.
YanY., QianY., SharifH. and TipperD., A survey on cyber security for smart grid communications, IEEE Communications Surveys and Tutorials14(4) (2012), 998–1010.
6.
LefevreT., RondetC., ParizotI. and ChauvinP., Applying multivariate clustering techniques to health data: The 4 types of healthcare utilization in the paris metropolitan area, PloS One9(12) (2014).
7.
XuC. and SuZ., Identification of cell types from single-cell transcriptomes using a novel clustering method, Bioinformatics37(10) (2015), 2041–2256.
8.
JaegerD., BarthJ., NiehuesA. and FufezanC., pyGCluster, a novel hierarchical clustering approach, Bioinformatics30(6) (2014), 896–898.
9.
ChangM.-S., ChenL.-H., HungL.-J., RossmanithP. and WuG.-H., Exact algorithms for problems related to the densest k-set problem, Information Processing Letters114(9) (2014), 510–513.
10.
ShovonMd.H.I. and HaqueM., An Approach of Improving Student’s Academic Performance by using K-means clustering algorithm and Decision tree, International Journal of Advanced Computer Science and Applications3(8) (2012).
11.
Markowska-KaczmarU., KwasnickaH. and ParadowskiM., Intelligent techniques in personalization of learning in e-learning systems, In Computational Intelligence for Technology Enhanced Learning, SpringerBerlin Heidelberg, 2010, pp. 1–23.
12.
LuJ., LiongV.E., ZhouX. and ZhouJ., Learning compact binary face descriptor for face recognition, IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI)37(10) (2015), 2041–2256.
13.
LuJ., ZhouX., TanY.-P., ShangY. and ZhouJ., Neighborhood repulsed metric learning for kinship verification, IEEE Transactions on Pattern Analysis and Machine Intelligence (T-PAMI)36(2) (2014), 331–345.
14.
LvZ.et al., Managing big city information based on webVRGIS, IEEE Access4 (2016), 407–415.
15.
SunY., BieR. and ZhangJ., Measuring semantic-based structural similarity in multi-relational networks, International Journal of Data Warehousing and Mining12(1) (2016), 20–33.
16.
LinY., YangJ., LvZ.et al., A self-assessment stereo capture model applicable to the internet of things[J], Sensors15(8) (2015), 20925–20944.
17.
MehmoodR., ShaikhM.U. and BieR., amd H. Dawood, Iot enable web warehouse architecture: A secure approach, Personal and Ubiquitous19(7) (2015), 1157–1167.
18.
SunY. and JaraA.J., An extensible and active semantic model of information organizing for the Internet of Things, Personal and Ubiquitous18(8) (2014), 1821–1833.
19.
SunY., YanH., LuC., BieR. and ZhouZ., Constructing the web of events from raw data in the web of things, Mobile Information Systems11(1) (2014), 105–125.
20.
SunY., YanH., ZhangJ., XiaY., WangS., BieR. and TianY., Organizing and querying the big sensing data with event-linked network in the internet of things, International Journal of Distributed Sensor Networks2014 (2014).
21.
LvZ., YinT., HanY., ChenY.et al., WebVR–web virtual reality engine based on P2P network[J], Journal of Networks6(7) (2011), 990–998.
22.
Lovely SharmaP. and
RamyaK.A., Review on density based clustering algorithms for very large datasets, International Journal of Emerging Technology and Advanced Engineering3(12) (2013), 398–403.
23.
ShahG.H., BhensdadiaC.K. and GanatraA.P., An empirical evaluation of density-based clustering techniques, International Journal of Soft Computing and Engineering (IJSCE) (2012), 2231–2307.
24.
ParimalaM., LopezD. and SenthilkumarN.C., A survey on density based clustering algorithms for mining large spatial databases, International Journal of Advanced Science and Technology31(1) (2011), 59–66.
25.
EsterM., KriegelH.-P., SanderJ. and XuX., A density-based algorithm for discovering clusters in large spatial databases with noise, In Kdd96(34) (1996), 226–231.
26.
BirantD. and KutA., ST-DBSCAN: An algorithm for clustering spatial-temporal data, Data and Knowledge Engineering60(1) (2007), 208–221.
27.
LiuP., ZhouD. and WuN., VDBSCAN: Varied density based spatial clustering of applications with noise, In Procedding: Service Systems and Service Management, 2007, pp. 1–4.
28.
MehmoodR., ZhangaG., BieaR., DawoodaH. and AhmadH., Clustering by fast search and find of density peaks via heat-diffusion, Neurocomputing, Special Issue on Bridging the Semantic Gap in Multimedia Understanding, 2016 (Forthcoming).
29.
SheatherS.J. and JonesM.C., A reliable data-based bandwidth selection method for kernel density estimation, Journal of the Royal Statistical Society Series b-Methodological53(3) (1991), 683–690.
30.
FrantiP. and VirmajokiO., Iterative shrinking method for clustering problems, Pattern Recognition39(5) (2006), 761–775.
31.
BhatnagarV., KaurS. and ChakravarthyS., Clustering data streams using grid-based synopsis, Knowledge and Information Systems41(1) (2014), 127–152.
32.
SunY. and LuY., A grid-based subspace clustering algorithm for high-dimensional data streams, In: Proceeding of 1st International Conference on Advanced Data Mining and Applications Location: Wuhan, PEOPLES R CHINA, 2005.
33.
ChenN., XuZ.-S. and XiaM.-M., Hierarchical hesitant fuzzy K-means clustering algorithm, Applied Mathematics-A Journal of Chinese Universities29(1) (2014), 1–17.
34.
JacquesJ. and PredaC., Functional data clustering: A survey, Advances in Data Analysis and Classification8(3) (2014), 231–255.
35.
MacQueenJ., Some methods for classification and analysis of multivariate observations, In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability1(14) (1967), 281–297.
36.
FreyB.J. and DueckD., Clustering by passing messages between data points, Science315(5814) (2007), 972–976.
37.
ChengY., Mean shift, mode seeking, and clustering, IEEE Transactions on Pattern Analysis and Machine Intelligence17(8) (1995), 790–799.
38.
KrishnaswamyS., MatthewH.S., MingueneauM., BendallS.C., LitvinO., StoneE., Pe’erD. and NolanG.P., Conditional density-based analysis of T cell signaling in single-cell data, Science346(6213) (2014), 1250689.
39.
LahariK., Ramakrishna MurtyM. and
SatapathyS.C., Partition based clustering using genetic algorithm and teaching learning based optimization: Performance analysis, Advances in Intelligent Systems and Computing338 (2015), 191–200.
40.
RodriguezA. and LaioA., Clustering by fast search and find of density peaks, Science344(6191), 1492–1496.
41.
BotevZ.I., GrotowskiJ.F. and KroeseD.P., Kernel density estimation via diffusion, The Annals of Statistics38(5) (2010), 2916–2957.
42.
ScottD.W., Multivariate Density Estimation. Theory, Practice and Visu-alization, Wiley, New York, MR1191168, 1992.
43.
LehmannE.L., Model specification: The views of Fisher and Neyman, and later develop-ments, Statistical Science5(2) (1990), 160–168.
44.
FelberT., KohlerM. and KrzyrakA., Adaptive Density Estimation from Data Containing Bounded Measurement Errors, In Stochastic Models, Statistics and Their Applications, 2015, pp. 67–74.
45.
RosenblattM., Remarks on some nonparametric estimates of a density-function, Annals of Mathematical Statistics27(3) (1956), 832–837.
46.
FukunagaK. and HostetlerL., The estimation of the gradient of a density function, with applications in pattern recognition, IEEE Transactions on Information Theory21 (1975), 32–40.
47.
GionisA., MannilaH. and TsaparasP., Clustering aggregation, ACM Transactions on Knowledge Discovery from Data (TKDD)1(1) (2007), 1–30.
48.
FuL. and MedicoE., FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data, BMC Bioinformatics8(3) (2007), artical.
