In this paper the Unsupervised Active Learning Method (UALM), a novel clustering method based on the Active Learning Method (ALM) is introduced. ALM is an adaptive recursive fuzzy learning algorithm inspired by some behavioral features of human brain functionality. UALM is a density-based clustering algorithm that relies on discovering densely connected components of data, where it can find clusters of arbitrary shapes. This approach is a noise-robust clustering method. The algorithm first blurs the data points as ink drop patterns, then summarizes the effects of all data points, and finally puts a threshold on the resulting pattern. It uses the connected-component algorithm for finding clusters. Then determines cluster centers by intersecting the narrow-paths. Experimental results confirmed the superiority of our proposed method compared to the two most well-known density-based clustering algorithms, DBSCAN and DENCLUE.
ZhaiJ.-H., XuH.-Y. and WangX.-Z., Dynamic ensemble extreme learning machine based on sample entropy, Soft Computing16 (2012), 1493–1502.
2.
TrikhaP. and VijendraS., Fast density based clustering algorithm, International Journal of Machine Learning and Computing3 (2013), 10–12.
3.
KaufmanL. and RousseeuwP.J., Finding groups in data: An introduction to cluster analysis, vol. 344: John Wiley & Sons, 2009.
4.
AshfaqR.A.R., WangX.-Z., HuangJ.Z., AbbasH. and HeY.-L., Fuzziness based i-supervised learning approach for intrusion detection system, Information Sciences (2016)–sem.
5.
ZhaoS., TsangE.C., ChenD. and WangX., Building a rule-based classifier—A fuzzy-rough set approach, Knowledge and Data Engineering, IEEE Transactions on22 (2010), 624–638.
6.
BerkhinP., A survey of clustering data mining techniques, in Grouping multidimensional data, ed: SpringerBerlin Heidelberg, 2006, pp. 25–71.
7.
AggarwalC.C. and ReddyC.K., Data clustering: Algorithms and applications, CRC Press Book, 2013.
8.
HanJ., KamberM., PeiJ., Data mining: Concepts and techniques, 2006.
9.
TanP.-N., SteinbachM. and KumarV., Introducing to data Mining, ed: Pearson Education Asia LTD, 2006.
10.
EsterM., KriegelH.-P., SanderJ. and XuX., A density-based algorithm for discovering clusters in large spatial databases with noise, in Kdd, 1996, pp. 226–231.
11.
GaonkarM.N. and SawantK., AutoEpsDBSCAN: DBSCAN with Eps automatic for large dataset, Published in International Journal on Advanced Computer Theory and Engineering (IJACTE)2 (2013), 2319–2526.
12.
AnkerstM., BreunigM.M., KriegelH.-P. and SanderJ., OPTICS: Ordering points to identify the clustering structure, in ACM Sigmod Record, 1999, pp. 49–60.
13.
HinneburgA. and KeimD.A., An efficient approach to clustering in large multimedia databases with noise, in KDD, 1998, pp. 58–65.
14.
HinneburgA. and GabrielH.-H., Denclue 2.0: Fast clustering based on kernel density estimation, in Advances in Intelligent Data Analysis VII, ed: Springer, 2007, pp. 70–80.
15.
ShourakiS.B. and HondaN., Recursive fuzzy modeling based on fuzzy interpolation, Journal of Advanced Computional Intelligence (JACIII)3 (1999), 114–125.
16.
MurakamiM. and HondaN., A study on the modeling ability of the IDS method: A soft computing technique using pattern-based information processing, International Journal of Approximate Reasoning45 (2007), 470–487.
17.
MurakamiM. and HondaN., A basic constructive algorithm for the IDS method, in SCIS & ISIS, 2006, pp. 355–360.
18.
BahrpeymaF., CranganuC. and DadanehB.Z., Active learning method for estimating missing logs in hydrocarbon reservoirs, inArtificial Intelligent Approaches in Petroleum Geosciences, ed: Springer, 2015, pp. 209–224.
19.
CranganuC. and BahrpeymaF., Use of active learning method to determine the presence and estimate the magnitude of abnormally pressured fluid zones: A case study from the Anadarko Basin, Oklahoma, in Artificial Intelligent Approaches in Petroleum Geosciences, ed: Springer, 2015, pp. 191–208.
20.
GhorbaniM.J., ChoudhryM.A. and FeliachiA., Distributed multi-agent based load shedding in power distribution systems, in Electrical and Computer Engineering (CCECE), 2014 IEEE 27th Canadian Conference on, 2014, pp. 1–6.
21.
ShahdiS.A. and ShourakiS.B., Supervised active learning method as an intelligent linguistic controller and its hardware implementation, in 2nd IASTEAD International Conference on Artificial Intelligence and Applications (AIA’02), Malaga, Spain, 2002, pp. 453–458.
22.
SakuraiY., A study of the learning control method using PBALM-a nonlinear modeling method, Ph.D. Dissertation, The University of Electro-Communications, Tokyo, Japan, 2005.
23.
FirouziM., ShourakiS.B. and ConradtJ., Sensorimotor Control Learning Using a New Adaptive Spiking Neuro-Fuzzy Machine, Spike-IDS and STDP, in Artificial Neural Networks and Machine Learning–ICANN 2014, ed: Springer, 2014, pp. 379–386.
24.
BahrpeymaF., ZakerolhoseiniA. and HaghighiH., Using IDS fitted Q to develop a real-time adaptive controller for dynamic resource provisioning in Cloud’s virtualized environment, Applied Soft Computing26 (2015), 285–298.
25.
MurakamiM. and HondaN., Classification performance of the IDS method based on the two-spiral benchmark, in IEEE International Conference on Systems, Man and Cybernetics, 2005, pp. 3797–3803.
26.
FirouziM., ShourakiS.B. and AfrakotiI.E.P., Pattern analysis by active learning method classifier, Journal of Intelligent and Fuzzy Systems26 (2014), 49–62.
27.
GanG., MaC. and WuJ., Data clustering: Theory, algorithms, and applications, vol. 20, Siam, 2007.
28.
KaurP.J., A survey of clustering techniques and algorithms, in Computing for Sustainable Global Development (INDIACom), 2015 2nd International Conference on, 2015, pp. 304–307.
ZhangT., RamakrishnanR. and LivnyM., BIRCH: An efficient data clustering method for very large databases, in ACM SIGMOD Record, 1996, pp. 103–114.
31.
GuhaS., RastogiR. and ShimK., CURE: An efficient clustering algorithm for large databases, in ACM SIGMOD Record, 1998, pp. 73–84.
32.
BanfieldJ.D. and RafteryA.E., Model-based Gaussian and non-Gaussian clustering, Biometrics (1993), 803–821.
33.
FraleyC. and RafteryA.E., Model-based clustering, discriminant analysis, and density estimation, Journal of the American statistical Association97 (2002), 611–631.
34.
SchikutaE. and ErhartM., The BANG-clustering system: Grid-based data analysis, in Advances in Intelligent Data Analysis Reasoning about Data, ed: Springer, Berlin Heidelberg, 1997, pp. 513–524.
35.
WangW., YangJ. and MuntzR., STING: A statistical information grid approach to spatial data mining, in VLDB, 1997, pp. 186–195.
36.
SheikholeslamiG., ChatterjeeS. and ZhangA., Wavecluster: A multi-resolution clustering approach for very large spatial databases, in VLDB, 1998, pp. 428–439.
37.
AgrawalR., GehrkeJ., GunopulosD. and RaghavanP., Automatic subspace clustering of high dimensional data for data mining applications, vol. 27: ACM, 1998.
38.
GoilS., NageshH. and ChoudharyA., MAFIA: Efficient and scalable subspace clustering for very large data sets, in Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999, pp. 443–452.
39.
LohW.-K. and ParkY.-H., A Survey on Density-Based Clustering Algorithms, in Ubiquitous Information Technologies and Applications, ed: Springer, 2014, pp. 775–780.
40.
HouJ., GaoH. and LiX., DSets-DBSCAN: A parameter-free clustering algorithm, IEEE Transactions on Image Processing25 (2016), 3182–3193.
41.
SharmaP. and RathiY., Efficient Density-Based Clustering Using Automatic Parameter Detection, in Proceedings of the International Congress on Information and Communication Technology, 2016, pp. 433–441.
42.
DockhornA., BrauneC. and KruseR., An Alternating Optimization Approach Based on Hierarchical Adaptations of DBSCAN, in Computational Intelligence, 2015 IEEE Symposium Series on, 2015, pp. 749–755.
43.
KumarK.M. and ReddyA.R.M., A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method, Pattern Recognition58 (2016), 39–48.
44.
ZhangY., WangX., LiB., ChenW., WangT. and LeiK., Dboost: A Fast Algorithm for DBSCAN-based Clustering on High Dimensional Data, in Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2016, pp. 245–256.
45.
RehiouiH., IdrissiA., AbourezqM. and ZegrariF., DENCLUE-IM: A new approach for big data clustering, Procedia Computer Science83 (2016), 560–567.
46.
IdrissiA., RehiouiH., LaghrissiA. and RetalS., An improvement of DENCLUE algorithm for the data clustering, in 2015 5th International Conference on Information & Communication Technology and Accessibility (ICTA), 2015, pp. 1–6.
47.
SettlesB., Active learning literature survey, Computer Sciences Technical Report 1648 University of Wisconsin, Madison, vol. 52, 2010, p. 11.
48.
FirouziM., ShourakiS.B. and RostamiM.G., Spiking Neural Network Ink Drop Spread, Spike-IDS, in Advances in Cognitive Neurodynamics (III), ed: Springer, Netherlands, 2013, pp. 59–68.
49.
AfrakotiI.E.P., ShourakiS.B. and MerrikhbayatF., Using memristor crossbar structure to implement a novel adaptive real time fuzzy modeling algorithm, arXiv preprint arXiv:1309.3242, 2013.
50.
AfrakotiI.E.P., GhaffariA. and ShourakiS.B., Effective partitioning of input domains for ALM algorithm, in First Iranian Conference on Pattern Recognition and Image Analysis (PRIA), 2013, pp. 1–5.
51.
Merrikh-BayatF. and ShourakiS.B., The neuro-fuzzy computing system with the capacity of implementation on a memristor crossbar and optimization-free hardware training, Fuzzy Systems, IEEE Transactions on22 (2014), 1272–1287.
52.
Esmaili Paeen AfrakotiI.,
ShourakiS.B. and HaghighatB., An optimal hardware implementation for active learning method based on memristor crossbar structures, Systems Journal, IEEE8 (2014), 1190–1199.
53.
Di StefanoL. and
BulgarelliA., A simple and efficient connected components labeling algorithm, in International Conference on Image Analysis and Processing, 1999, pp. 322–327.
54.
SametH. and TamminenM., Efficient component labeling of images of arbitrary dimension represented by linear bintrees, IEEE Transactions on Pattern Analysis and Machine Intelligence10 (1988), 579–586.
55.
DillencourtM.B., SametH. and TamminenM., A general approach to connected-component labeling for arbitrary image representations, Journal of the ACM (JACM)39 (1992), 253–280.
56.
FisherR., PerkinsS., WalkerA. and WolfartE., Connected component labeling, 2003.
57.
WangX.-Z. and DongC.-R., Improving generalization of fuzzy IF–THEN rules by maximizing fuzzy entropy, IEEE Transactions on fuzzy systems17 (2009), 556–567.
58.
ZakiM.J. and MeiraW.Jr, Data mining and analysis: Fundamental concepts and algorithms, Cambridge University Press, 2014.
59.
RendónE., AbundezI., ArizmendiA. and QuirozE., Internal versus external cluster validation indexes, International Journal of Computers and Communications5 (2011), 27–34.
60.
LarsenB. and AoneC., Fast and effective text mining using linear-time document clustering, in Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999, pp. 16–22.
61.
VinhN.X., EppsJ. and BaileyJ., Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance, The Journal of Machine Learning Research11 (2010), 2837–2854.
62.
AlhanjouriM.A. and AhmedR.D., New density-based clustering technique: GMDBSCAN-UR, International Journal of Advanced Research in Computer Science3 (2012).
63.
KellnerD., KlappsteinJ. and DietmayerK., Grid-based DBSCAN for clustering extended objects in radar data, in Intelligent Vehicles Symposium (IV), 2012 IEEE, 2012, pp. 365–370.
64.
UncuO., GruverW.A., KotakD.B., SabazD., AlibhaiZ. and NgC., Gridbscan: Grid density-based spatial clustering of applications with noise, in 2006 IEEE International Conference on Systems, Man and Cybernetics, 2006, pp. 2976–2981.
65.
MaL., GuL., LiB., QiaoS. and WangJ., G-DBSCAN: An improved DBSCAN clustering method based on grid, Adv Sci Technol Lett74 (2014), 23–28.
