ijece-202605192320260519230932CMV Verlagkhoffmann@cmv-verlag.comCMV VerlagNashriyyah -i Muhandisi -i Barq va Muhandisi -i Kampyutar -i Iranijece16823745322019163M.Mahmoudiنگیندانشپور32201916918210.66224/ijece.28367.16.3.169http://ijece.org/en/Article/28367http://ijece.org/en/Article/Download/28367http://ijece.org/en/Article/Download/28367http://ijece.org/en/Article/Download/28367http://ijece.org/en/Article/Download/28367http://ijece.org/en/Article/Download/28367http://ijece.org/en/Article/Download/28367http://ijece.org/en/Article/Download/28367[1] C. C. Hsu and Y. P. Huang, "Incremental clustering of mixed data based on distance hierarchy," Expert Syst. Appl., vol. 35, no. 3, pp. 1177-1185, Oct. 2008. [2] J. Liang, X. Zhao, D. Li, F. Cao, and C. Dang, "Determining the number of clusters using information entropy for mixed data," Pattern Recognit., vol. 45, no. 6, pp. 2251-2265, Jun. 2012. [3] A. Foss, M. Markatou, B. Ray, and A. Heching, "A semiparametric method for clustering mixed data," Mach. Learn., vol. 105, no. 3, pp. 419-458, Dec. 2016. [4] F. Cao, et al., "An algorithm for clustering categorical data with set-valued features," IEEE Trans. Neural Networks Learn. Syst., vol. 29, no. 10, pp. 4593-4606, Oct. 2017. [5] F. Noorbehbahani, S. R. Mousavi, and A. Mirzaei, "An incremental mixed data clustering method using a new distance measure," Soft Comput., vol. 19, no. 3, pp. 731-743, Mar. 2015. [6] B. Bahmani, B. Moseley, A. Vattani, R. Kumar, and S. Vassilvitskii, "Scalable K-means ++," in Proc. VLDB Endow., vol. 5, pp. 622-633, Mar. 2012. [7] Y. Kim, K. Shim, M. S. Kim, and J. Sup Lee, "DBCURE-MR: an efficient density-based clustering algorithm for large data using MapReduce," Inf. Syst., vol. 42, pp. 15-35, Jun. 2014. [8] E. Gungor and A. Ozmen, "Distance and density based clustering algorithm using Gaussian kernel," Expert Syst. Appl., vol. 69, pp. 10-20, 1 Mar. 2017. [9] Z. He, X. Xu, and S. Deng, "Scalable algorithms for clustering large datasets with mixed type attributes," Int. J. Intell. Syst., vol. 20, no. 10, pp. 1077-1089, Oct. 2005. [10] X. Cui, P. Zhu, X. Yang, K. Li, and C. Ji, "Optimized big data K-means clustering using MapReduce," J. Supercomput., vol. 70, no. 3, pp. 1249-1259, Dec. 2014. [11] A. Hadian and S. Shahrivari, "High performance parallel k-means clustering for disk-resident datasets on multi-core CPUs," J. Supercomput., vol. 69, no. 2, pp. 845-863, Aug. 2014. [12] T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, "An efficient k-means clustering algorithm: analysis and implementation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 7, pp. 881-892, Jul. 2002. [13] S. A. Ludwig, "MapReduce-based fuzzy c-means clustering algorithm: implementation and scalability," Int. J. Mach. Learn. Cybern., vol. 6, no. 6, pp. 923-934, Dec. 2015. [14] S. Fosso Wamba, S. Akter, A. Edwards, G. Chopin, and D. Gnanzou, "How 'big data' can make big impact: findings from a systematic review and a longitudinal case study," Int. J. Prod. Econ., vol. 165, pp. 234-246, Jul. 2015. [15] J. Han, J. Pei, and M. Kamber, Data Mining: Concepts and Techniques, Elsevier Science, 2011. [16] T. Wangchamhan, S. Chiewchanwattana, and K. Sunat, "Efficient algorithms based on the k-means and chaotic league championship algorithm for numeric, categorical, and mixed-type data clustering," Expert Syst. Appl., vol. 90, pp. 146-167, 30 Dec. 2017. [17] B. Y. J. Dean and S. Ghemawat, "MapReduce: a flexible data processing tool," Commun. ACM, vol. 53, no. 1, pp. 72-77, Jan. 2010. [18] T. White, Hadoop: The Definitive Guide, vol. 54, 2012. [19] W. Zhao, H. Ma, and Q. He, "Parallel K-means clustering based on MapReduce," in Lecture Notes in Computer Science, vol. LNCS5931, pp. 674-679, 2009. [20] F. Barcelo-Rico and J. L. Diez, "Geometrical codification for clustering mixed categorical and numerical databases," J. Intell. Inf. Syst., vol. 39, no. 1, pp. 167-185, Dec. 2011. [21] H. S. M. Coxeter, P. Du Val, H. T. Flather, and J. F. Petrie, The Fifty-Nine Icosahedra, New York, NY: Springer New York, 1982. [22] A. Likas, N. Vlassis, and J. J. Verbeek, "The global k-means clustering algorithm," Pattern Recognit., vol. 36, no. 2, pp. 451-461, Feb. 2003. [23] Y. He, et al., "MR-DBSCAN: an efficient parallel density-based clustering algorithm using MapReduce," in Proc. of the Int. Conf. on Parallel and Distributed Systems, ICPADS’11, pp. 473-480, Tainan, Taiwan, 7-9 Dec. 2011. [24] M. Ester, H. P. Kriegel, J. Sander, and X. Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise," in Proc. of the 2nd Int. Conf. on Knowledge Discovery and Data Mining, , PAKDD’96, pp. 226-231, Portland, OR, US, 2-4 Aug. 1996. [25] Z. Huang, "Clustering large data sets with mixed numeric and categorical values," in Proc. 1st Pacific-Asia Conf. Knowl. Discov. Data Mining, PAKDD’97, pp. 21-34, 1997. [26] M. A. Ben Haj Kacem, C. E. Ben N'Cir, and N. Essoussi, "MapReduce-based k-prototypes clustering method for big data," in Proc. of the IEEE Int. Conf. on Data Science and Advanced Analytics, DSAA’11, pp. 473 - 480, Tainan, Taiwan, 7-9 Dec. 2011. [27] V. V. Ayuyev, A. Thura, N. N. Hlaing, and M. B. Loginova, "The quick dynamic clustering method for mixed-type data," Autom. Remote Control, vol. 73, no. 12, pp. 2083-2088, Dec. 2012. [28] C. M. Ayuyev, V.V., Aung, Z.Y., and Thein, The Domain Compensation Method for Incomplete Information in a Database, Tr. Mosk. Gos. Tekhn, pp. 57-64, 2007. [29] S. Hassani, Mathematical Physics: A Modern Introduction to Its Foundations, 2nd Edition, 2013. [30] L. Wang, et al., "Cloud computing: a perspective study," New Gener. Comput., vol. 28, no. 2, pp. 137-146, Apr. 2010. [31] E. Achtert, H. P. Kriegel, and A. Zimek, "ELKI: a software system for evaluation of subspace clustering algorithms," in Ludäscher B., Mamoulis N. (eds) Scientific and Statistical Database Management, SSDBM 2008. Lecture Notes in Computer Science, vol 5069, pp. 580-585, 2008. [32] UCI Machine Learning Repository, Individual Household Electric Power Consumption Data Set, [Online]. Available: https://archive.ics.uci.edu/ml/datasets/Individual+household+electric+power+consumption. [Accessed: 30-Apr-2018]. [33] R. Andraka, "A survey of CORDIC algorithms for FPGA based computers," in Proc. ACMSIGDA 6th Int. Symp. F. Program. Gate Arrays, FPGA’98, pp. 191-200, Monterey, California, US, 22-25 Feb. 1998. [34] A. Fahad, et al., "A survey of clustering algorithms for big data: taxonomy and empirical analysis," IEEE Trans. Emerg. Top. Comput., vol. 2, no. 3, pp. 267-279, Sept. 2014. [35] Z. Liu, Q. Pan, J. Dezert, and A. Martin, "Adaptive imputation of missing values for incomplete pattern classification," Pattern Recognit., vol. 52, pp. 85-95, Apr. 2016.M.Rezapoor MirsalehM. R.Meybodi32201918319510.66224/ijece.28368.16.3.183http://ijece.org/en/Article/28368http://ijece.org/en/Article/Download/28368http://ijece.org/en/Article/Download/28368http://ijece.org/en/Article/Download/28368http://ijece.org/en/Article/Download/28368http://ijece.org/en/Article/Download/28368http://ijece.org/en/Article/Download/28368http://ijece.org/en/Article/Download/28368[1] C. Xianshun, O. Yew-Soon, L. Meng-Hiot, and T. Kay Chen, "A multi-facet survey on memetic computation," IEEE Trans. on Evolutionary Computation, ,vol. 15, no. 5, pp. 591-607, Oct. 2011. [2] Q. H. Nguyen, Y. S. Ong, and N. Krasnogor, "A study on the design issues of memetic algorithm," in Proc. CEC IEEE Congress on Evolutionary Computation, pp. 2390-2397, Singapore, Singapore, 25-28 Sept.. 2007. [3] N. Krasnogor and J. Smith, "A tutorial for competent memetic algorithms: model, taxonomy, and design issues," IEEE Trans. on Evolutionary Computation, vol. 9, no. 5, pp. 474-488, Oct. 2005. [4] J. Hong and V. Prabhu, "Distributed reinforcement learning control for batch sequencing and sizing in just-in-time manufacturing systems," Applied Intelligence, vol. 20, no. 1, pp. 71-87, Jan. 2004. [5] M. A. Wiering and H. van Hasselt, "Ensemble algorithms in reinforcement learning," IEEE Trans. on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 38, no. 4, pp. 930-936, Aug. 2008. [6] K. S. Narendra and M. A. L. Thathachar, Learning Automata: an Introduction, Prentice-Hall, Inc., 1989. [7] M. A. L. Thathachar and P. S. Sastry, "Varieties of learning automata: an overview," IEEE Trans. on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 32, no. 6, pp. 711-722, Dec. 2002. [8] K. Najim and A. S. Poznyak, Learning Automata: Theory and Applications, Pergamon Press, Inc., 1994. [9] M. A. L. Thathachar and P. S. Sastry, Networks of Learning Automata: Techniques for Online Stochastic Optimization, Kluwer Academic Publishers, 2004. [10] M. Rezapoor Mirsaleh and M. R. Meybodi, "A hybrid algorithm for solving graph isomorphism problem," in Proc. of the 2nd Int. Conf. on Information and Knowledge Technology, IKT'05, 13 pp., Tehran, Iran, 24-26 May 2005. [11] M. Rezapoor Mirsaleh and M. R. Meybodi, "A learning automata-based memetic algorithm," Genetic Programming and Evolvable Machines, vol. 16, no. 4, pp. 399-453, Dec. 2015. [12] M. Rezapoor Mirsaleh and M. R. Meybodi, "Balancing exploration and exploitation in memetic algorithms: a learning automata approach," Computational Intelligence, vol. 34, no. 1, pp. 282-309, Feb. 2018. [13] A. Rezvanian and M. R. Meybodi, "A new learning automata‐based sampling algorithm for social networks," International J. of Communication Systems, vol. 3, no. 5, pp. 1-21, Mar. 2015. [14] M. Ghavipour and M. R. Meybodi, "Irregular cellular learning automata-based algorithm for sampling social networks," Engineering Applications of Artificial Intelligence, vol. 59, pp. 244-259, Mar. 2017. [15] M. Rezapoor Mirsaleh and M. R. Meybodi, "A michigan memetic algorithm for solving the community detection problem in complex network," Neurocomputing, vol. 214, pp. 535-545, 19 Nov. 2016. [16] B. Moradabadi and M. R. Meybodi, "Link prediction based on temporal similarity metrics using continuous action set learning automata," Physica A: Statistical Mechanics and its Applications, vol. 160, no. 2, pp. 361-373, Feb. 2016. [17] M. Rezapoor Mirsaleh and M. R. Meybodi, "A new memetic algorithm based on cellular learning automata for solving the vertex coloring problem," Memetic Computing, vol. 8, no. 3, pp. 211-222, Sept. 2016. [18] M. Rezapoor Mirsaleh and M. R. Meybodi, "A michigan memetic algorithm for solving the vertex coloring problem," J. of Computational Science, vol. 24, no. 2, pp. 389-401, Oct. 2017. [19] S. M. Vahidipour, M. R. Meybodi, and M. Esnaashari, "Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic petri nets," International J. of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 25, no. 3, pp. 427-455, Jan. 2017. [20] S. M. Vahidipour, M. R. Meybodi, and M. Esnaashari, "Cellular adaptive petri net based on learning automata and its application to the vertex coloring problem," Discrete Event Dynamic Systems, vol. 27, no. 4, pp. 609-640, May. 2017. [21] A. M. Saghiri and M. R. Meybodi, "A self-adaptive algorithm for topology matching in unstructured peer-to-peer networks," J. of Network and Systems Management, vol. 24, no. 2, pp. 393-426, Apr. 2016. [22] A. M. Saghiri and M. R. Meybodi, "An approach for designing cognitive engines in cognitive peer-to-peer networks," J. of Network and Computer Applications, vol. 70, pp. 17-40, Jul. 2016. [23] M. Ghavipour and M. R. Meybodi, "An adaptive fuzzy recommender system based on learning automata," Electronic Commerce Research and Applications, vol. 20, pp. 105-115, Nov./Dec. 2016. [24] B. J. Oommen and D. C. Y. Ma, "Deterministic learning automata solutions to the equipartitioning problem," IEEE Trans. on Computers, vol. 37, no. 1, pp. 2-13, Jan. 1988. [25] M. Rezapoor Mirsaleh and M. R. Meybodi, "Improving GA+LA algorithm for solving graph isomorphic problem," in Proc. of the 11th Annual CSI Computer Conf. of Iran, pp. 474-483, Tehran, Iran, Jan. 2006. [26] K. Asghari, A. Safari Mamaghani, and M. R. Meybodi, "An evolutionary approach for query optimization problem in database," in Proc. of Int. Joint Conf. on Computers, Information and System Sciences, and Engineering, CISSE'07, University of Bridgeport, England, 9 pp., Dec. 2007. [27] A. Safari Mamaghani, K. Asgari, M. R. Meybodi, and F. Mahmoodi, "A new method based on genetic algorithm for minimizing join operations cost in data base," in Proc. of 13th Annual CSI Computer Conf. of Iran,6 pp., Kish Island, Iran, Mar. 2008. [28] A. Safari Mamaghani, K. Asghari, F. Mahmoudi, and M. R. Meybodi, "A novel hybrid algorithm for joint ordering problem in database queries," in Proc. of 6th WSEAS Int. Conf. on Computational Intelligence, Man-Machine Systems and Cybernetics, pp. 104-109, Tenerife, Spain, 14-16 Dec. 2007. [29] K. Asghari, A. Safari Mamaghani, F. Mahmoudi, and M. R. Meybodi, "A relational databases query optimization using hybrid evolutionary algorithm," J. of Computer and Robotics, vol. 1, no. 1, pp. 28-39, Jan. 2008. [30] B. Zaree and M. R. Meybodi, "A hybrid method for sorting problem," in Proc. of the 3rd Int. Conf. on Information and Knowledge Technology, IKT'07, 8 pp., Mashhad, Iran, 26-28 Nov. 2007. [31] B. Zaree and M. R. Meybodi, "An evolutionary method for solving symmetric TSP," in Proc. of the 3rd Int. Conf. on Information and Knowledge Technology, IKT'07, 8 pp., Mashhad, Iran, 26-28 Nov. 2007. [32] B. Zaree and M. R. Meybodi, "A hybrid method for solving traveling salesman problem," in Proc. of the 6th IEEE/ACIS Int. Conf. on Computer and Information Science, ICIS'07, pp. 394-399, Melbourne, Australia, 11-13 Jul. 2007. [33] B. Zaree, K. Asghari, and M. R. Meybodi, "A hybrid method based on clustering for solving large traveling salesman problem," in Proc. of 13th Annual CSI Computer Conf. of Iran, 6 pp., Kish Island, Iran, 9-11 Mar. 2008. [34] K. Asghari and M. R. Meybodi, "Searching for hamiltonian cycles in graphs using evolutionary methods," in Proc. of the 2nd Joint Congress on Fuzzy and Intelligent Systems, pp. 132-143, Tehran, Iran, 28-30 Oct. 2008. [35] A. Safari Mamaghani and M. R. Meybodi, "Hybrid algorithms (learning automata + genetic algorithm) for solving graph bandwidth minimization problem," in Proc. of the 2nd Joint Congress on Fuzzy and Intelligent Systems, 1 pp., Tehran, Iran, 28-30 Oct. 2008. [36] A. S. Mamaghani and M. R. Meybodi, "A learning automaton based approach to solve the graph bandwidth minimization problem," in Proc. 5th Int. Conf. on Application of Information and Communication Technologies, AICT'11, 5 pp., Baku, Azerbaijan 12-14 Oct. 2011. [37] A. Isazadeh, H. Izadkhah, and A. Mokarram, "A learning based evolutionary approach for minimization of matrix bandwidth problem," Appl. Math, vol. 6, no. 1, pp. 51-57, Apr. 2012. [38] A. Safari Mamaghani and M. R. Meybodi, "Hybrid evolutionary algorithms for solving software clustering problem," in Proc. of the 2nd Joint Congress on Fuzzy and Intelligent Systems, pp. 464-473, Tehran, Iran, Oct. 2008. [39] K. Asghari and M. R. Meybodi, "Solving single machine total weighted tardiness scheduling problem using learning automata and genetic algorithm," in Proc. of the 3rd Iran Data Mining Conf., IDMC'09, Tehran, Iran, 16 pp., Dec. 2009. [40] A. S. Mamaghani, M. Mahi, and M. R. Meybodi, "A learning automaton based approach for data fragments allocation in distributed database systems," in Proc. IEEE 10th Int. Conf. on Computer and Information Technology, CIT'10, pp. 8-12, Jun. 2010. [41] A. S. Mamaghani, M. Mahi, M. R. Meybodi, and M. H. Moghaddam, "A novel evolutionary algorithm for solving static data allocation problem in distributed database systems," in Proc. 2nd Int. Conf. on Network Applications Protocols and Services, NETAPPS'10, pp. 14-19, Kedah, Malaysia, 22-23 Sept. 2010. [42] V. Majid Nezhad, H. Motee Gader, and E. Efimov, "A novel hybrid algorithm for task graph scheduling," IJCSI International J. of Computer Science Issues, vol. 8, no. 1, pp. 32-38, Nov. 2011. [43] A. Bansal and R. Kaur, "Task graph scheduling on multiprocessor system using genetic algorithm," International J. of Engineering Research & Technology, vol. 1, no. 5, pp. 1-5, Jan. 2012. [44] P. Foggia, C. Sansone, and M. Vento, "A database of graphs for isomorphism and sub-graph isomorphism benchmarking," in Proc. of the 3rd IAPR TC-15 Int. Workshop on Graph-Based Representations, pp. 176-187, May 2001. [45] W. Yuan-Kai, F. Kuo-Chin, and H. Jorng-Tzong, "Genetic-based search for error-correcting graph isomorphism," IEEE Trans. on, Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 27, no. 4, pp. 588-597, Aug. 1997. [46] J. R. Ullmann, "An algorithm for subgraph isomorphism," J. ACM, vol. 23, no. 1, pp. 31-42, Jan. 1976. [47] L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, "A (sub) graph isomorphism algorithm for matching large graphs," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 26, no. 10, pp. 1367-1372, Oct. 2004.K.AkbariJ.Abouei32201919620210.66224/ijece.28370.16.3.196http://ijece.org/en/Article/28370http://ijece.org/en/Article/Download/28370http://ijece.org/en/Article/Download/28370http://ijece.org/en/Article/Download/28370http://ijece.org/en/Article/Download/28370http://ijece.org/en/Article/Download/28370http://ijece.org/en/Article/Download/28370http://ijece.org/en/Article/Download/28370[1] B. Wang and K. J. R. Liu, "Advances in cognitive radio networks: a survey," IEEE J. of Selected Topics in Signal Processing, vol. 5, no. 1, pp. 5-23, Feb. 2011. [2] X. Shengli, L. Yi, Z. Yan, and Y. Rong, "A parallel cooperative spectrum sensing in cognitive radio networks," IEEE Trans. on Vehicular Technology, vol. 59, no. 8, pp. 4079-4092, Oct. 2010. [3] R. Saifan, A. E. Kamal, and Y. Guan, "Efficient spectrum searching and monitoring in cognitive radio network," in Proc. IEEE 8th Int. Conf. on Mobile Adhoc and Sensor Systems, MASS’11, pp. 520-529, Valencia, Spain, 17-22 Oct. 2011. [4] R. W. Thomas, R. S. Komali, B. J. Borghetti, and P. Mahonen, "A Bayesian game analysis of emulation attacks in dynamic spectrum access networks," in Proc IEEE Symp. on New Frontiers in Dynamic Spectrum, 11 pp., Singapore, Singapore, 6-9 Apr. 2010. [5] C. Zhao, L. Xie, X. Jiang, L. Huang, and Y. Yao, "A PHY-layer authentication approach for transmitter identification in cognitive radio networks," in Proc. Int. Conf. on Communications and Mobile Computing, CMC’10, vol. 2, pp. 154-158, Shenzhen, China, 12-14 Apr. 2010. [6] Z. Caidan, W. Wumei, H. Lianfen, and Y. Yan, "Anti-PUE attack base on the transmitter fingerprint identification in cognitive radio," in Proc. Int. Conf. on Wireless Communications, Networking and Mobile Computing, 5 pp., Beijing, China, 24-26 Sept. 2009. [7] W. L. Chin, et al., "Channel-based detection of primary user emulation attacks in cognitive radios," in Proc. IEEE Vehicular Technology Conf. (VTC Spring), 5 pp, Yokohama, Japan, 6-9 May 2012. [8] H. Li and Z. Han, "Dogfight in spectrum: combating primary user emulation attacks in cognitive radio systems, part i: known channel statistics," IEEE Trans. on Wireless Communications, vol. 9, no. 11, pp. 3566-3577, Nov. 2010. [9] N. Nguyen-Thanh, P. Ciblat, A. Pham, and V. Nguyen, "Surveillance strategies against primary user emulation attack in cognitive radio networks," IEEE Trans. on Wireless Communications, vol. 14, no. 9, pp. 4981-4993, Sep. 2015. [10] C. Biao, K. M. Borle, and D. Wenliang, "A physical layer authentication scheme for countering primary user emulation attack," in Proc. Int. Conf. on Acoustics, Speech, and Signal Processing, ICASSP'13, pp. 2935-2939, Vancouver, BC, Canada, 26-31 May 2013. [11] X. Chunsheng and M. Song, "Detection of PUE attacks in cognitive radio networks based on signal activity pattern," IEEE Trans. on Mobile Computing, vol. 13, no. 5, pp. 1022-1034, May 2014. [12] N. T. Nguyen, R. Zheng, and Z. Han, "On identifying primary user emulation attacks in cognitive radio systems using nonparametric Bayesian classification," IEEE Trans. on Signal Processing, vol. 60, no. 3, pp. 1432-1445, Mar. 2012. [13] Y. W. Teh, Dirichlet Processes, Encyclopedia of Machine Learning, Springer, 2010. [14] M. Bkassiny, S. K. Jayaweera, and L. Yang, "Multidimensional Dirichlet process-based non-parametric signal classification for autonomous self-learning cognitive radios," IEEE Trans. on Wireless Communications, vol. 12, no. 11, pp. 5413-5423, Nov. 2013. [15] M. D. Escobar and M. West, "Bayesian density estimation and inference using mixtures," J. of the American Statistical Association, vol. 90, no. 430, pp. 577-588, Jun. 1995. [16] K. P. Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012. [17] J. R. Hershey and P. A. Olsen, "Approximating the Kullback Leibler divergence between Gaussian mixture models," in Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, ICASSP'07, vol. 4, pp. 317-320, Honolulu, HI, USA, 15-20, Apr. 2007.E.Mirzavand BorujeniD.RahbariM.Nickray32201920321210.66224/ijece.28371.16.3.203http://ijece.org/en/Article/28371http://ijece.org/en/Article/Download/28371http://ijece.org/en/Article/Download/28371http://ijece.org/en/Article/Download/28371http://ijece.org/en/Article/Download/28371http://ijece.org/en/Article/Download/28371http://ijece.org/en/Article/Download/28371http://ijece.org/en/Article/Download/28371[1] A. V. Dastjerdi and R. Buyya, "Fog computing: helping the internet of things realize its potential," Computer, vol. 49, no. 8, pp. 112-116, Aug. 2016. [2] S. Tomovic, K. Yoshigoe, I. Maljevic, and I. Radusinovic, "Software defined fog network architecture for iot," Wireless Personal Communications, vol. 92, no. 1, pp. 181-196, Jan. 2017. [3] X. Sun and N. Ansari, "Edgeiot: mobile edge computing for the internet of things," IEEE Communications Magazine, vol. 54, no. 12, pp. 22-29, Dec. 2016. [4] J. Gubbi, R. Buyya, S. Marusic, and M. Palaniswami, "Internet of things (iot): a vision, architectural elements, and future directions," Future Generation Computer Systems, vol. 29, no. 7, pp. 1645-1660, Sep. 2013. [5] H. Xia, R. H. Zhang, J. Yu, and Z. K. Pan, "Energy-efficient routing algorithm based on unequal clustering and connected graph in wireless sensor networks," International J. of Wireless Information Networks, vol. 23, no. 2, pp. 141-150, Jun. 2016. [6] S. Ivanov, S. Balasubramaniam, D. Botvich, and O. B. Akan, "Gravity gradient routing for information delivery in fog wireless sensor networks," Ad Hoc Networks, vol. 46, pp. 61-74, Aug. 2016. [7] M. Firdhous, O. Ghazali, and S. Hassan, "Fog computing: will it be the future of cloud computing," in Proc. 3rd Int. Conf. on Informatics & Application,s ICIA’14, pp. 8-15, Kuala Terengganu, Malaysia, Oct. 2014. [8] S. Lindsey and C. S. Raghavendra, "Pegasis: power-efficient gathering in sensor information systems," in Proc. Aerospace Conf. IEEE, vol. 3, pp. 1125-1130, Big Sky, MT, USA, Mar. 2002. [9] P. G. V. Naranjo, M. Shojafar, H. Mostafaei, Z. Pooranian, and E. Baccarelli, "P-sep: a prolong stable election routing algorithm for energylimited heterogeneous fog-supported wireless sensor networks," the J. of Supercomputing, vol. 73, no. 2, pp. 733-755, Feb. 2017. [10] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy- efficient communication protocol for wireless microsensor networks," in Proc. 33rd Annual Hawaii Int. Conf. on System Sciences, 10 pp., Maui, HI, USA, 7-7 Jan. 2000. [11] W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, "An application-specific protocol architecture for wireless microsensor networks," IEEE Trans. on Wireless Communications, vol. 1, no. 4, pp. 660-670, Dec. 2002. [12] W. B. Heinzelman, Application-Specific Protocol Architectures for Wireless Networks, Ph.D Thesis, Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science, 2000. [13] Y. Liu, J. Gao, Y. Jia, and L. Zhu, "A cluster maintenance algorithm based on leach-dchs protoclol," in Proc. IEEE Int. Conf. Networking, Architecture, and Storage, NAS'08, pp. 165-166, Chongqing, China, 12-14 Jun. 2008. [14] G. Smaragdakis, I. Matta, and A. Bestavros, Sep: A Stable Election Protocol for Clustered Heterogeneous Wireless Sensor Networks, Tech. Rep., Boston University Computer Science Department, pp. 1-11, May 2004. [15] D. Singh and C. K. Panda, "Performance analysis of modified stable election protocol in heterogeneous WSN," in Proc. Int. Conf. on Electrical, Electronics, Signals, Communication and Optimization, EESCO’15, 5 pp., Visakhapatnam, India, 24-25 Jan. 2015. [16] A. A. Malluh, K. M. Elleithy, Z. Qawaqneh, R. J. Mstafa, and A. Alanazi, "Em-sep: an efficient modified stable election protocol," in Proc. the IEEE Zone 1 Conf. of the American Society for Engineering Education, 7 pp., Bridgeport, CT, USA, 3-5 Apr. 2014. [17] J. Wang, X. Yang, T. Ma, M. Wu, and J. U. Kim, "An energy-efficient competitive clustering algorithm for wireless sensor networks using mobile sink," International J. of Grid and Distributed Computing, vol. 5, no. 4, pp. 79-92, Dec. 2012. [18] D. Karaboga, S. Okdem, and C. Ozturk, "Cluster based wireless sensor network routing using artificial bee colony algorithm," Wireless Networks, vol. 18, no. 7, pp. 847-860, Oct. 2012. [19] E. Baccarelli, N. Cordeschi, and V. Polli, "Optimal self-adaptive qos resource management in interference-affected multicast wireless networks," IEEE/ACM Trans. on Networking, vol. 21, no. 6, pp. 1750-1759, Jan. 2013. [20] C. Petrioli, M. Nati, P. Casari, M. Zorzi, and S. Basagni, "Alba-r: loadbalancing geographic routing around connectivity holes in wireless sensor networks," IEEE Trans. on Parallel and Distributed Systems, vol. 25, no. 3, pp. 529-539, Mar. 2014. [21] S. Tanwar, N. Kumar, and J. W. Niu, "Eemhr: energy-efficient multilevel heterogeneous routing protocol for wireless sensor networks," International J. of Communication Systems, vol. 27, no. 9, pp. 1289-1318, Mar. 2014. [22] D. Jiang, Z. Xu, W. Li, and Z. Chen, "Topology control-based collaborative multicast routing algorithm with minimum energy consumption," International J. of Communication Systems, vol. 30, no. 1, Article No. e2905, 10 Jan. 2017. [23] H. Orojloo and A. T. Haghighat, "A tabu search based routing algorithm for wireless sensor networks," Wireless Networks, vol. 22, no. 5, pp. 1711-1724, Jul. 2016. [24] D. R. Chen, "An energy-efficient qos routing for wireless sensor networks using self-stabilizing algorithm," Ad Hoc Networks, vol. 37, no. 2, pp. 240-255, Feb. 2016. [25] P. Kar and S. Misra, "Detouring dynamic routing holes in stationary wireless sensor networks in the presence of temporarily misbehaving nodes," International J. of Communication Systems, vol. 30, no. 4, pp. 1-17, Jun. 2017. [26] A. A. Rahat, R. M. Everson, and J. E. Fieldsend, "Evolutionary multipath routing for network lifetime and robustness in wireless sensor networks," Ad Hoc Networks, vol. 52, pp. 130-145, 29-29 Apr. 2016. [27] A. Razaque, et al., "H-LEACH: hybrid-low energy adaptive clustering hierarchy for wireless sensor networks," in Proc. IEEE Long Island Systems, Applications and Technology Conf., LISAT’16, 4 pp., Farmingdale, NY, USA, 29-29 Apr. 2016. [28] G. Xie, K. Ota, M. Dong, F. Pan, and A. Liu, "Energy-efficient routing for mobile data collectors in wireless sensor networks with obstacles," Peer-to-Peer Networking and Applications, vol. 10, no. 3, pp. 472-483, May 2017. [29] M. Aslam, E. U. Munir, M. M. Rafique, and X. Hu, "Adaptive energy efficient clustering path planning routing protocols for heterogeneous wireless sensor networks," Sustainable Computing: Informatics and Systems, vol. 12, pp. 57-71, Dec. 2016. [30] S. Alam and D. De, "Cloud smoke sensing using iarp, ierp and zrp routing protocols for wireless senor network," CSI Trans. on ICT, vol. 5, no. 1, pp. 119-124, Mar. 2017. [31] R. Moreno-Vozmediano, R. S. Montero, E. Huedo, and I. M. Llorente, "Cross-site virtual network in cloud and fog computing," IEEE Cloud Computing, vol. 4, no. 2, pp. 46-53, Apr. 2017. [32] J. Wang, J. Cao, S. Ji, and J. H. Park, "Energy-efficient cluster-based dynamic routes adjustment approach for wireless sensor networks with mobile sinks," The J. of Supercomputing, vol. 73, no. 7, pp. 3277-3290, Jul. 2017. [33] T. H. Luan, L. Gao, Z. Li, Y. Xiang, G. Wei, and L. Sun, "Fog computing: focusing on mobile users at the edge," arXiv preprint arXiv:1502.01815,11 pp., Mar. 2016. [34] F. Bonomi, R. Milito, J. Zhu, and S. Addepalli, "Fog computing and its role in the internet of things," in Proc. the 1st Edition of the MCC Workshop on Mobile Cloud Computing, ACM, pp. 13-15, Helsinki, Finland, 13-17 Aug. 2012. [35] J. Yang, X. Shi, M. Marchese, and Y. Liang, "An ant colony optimization method for generalized TSP problem," Progress in Natural Science, vol. 18, no. 11, pp. 1417-1422, Nov. 2008. [36] F. Karatas and I. Korpeoglu, "Fog-based data distribution service (F-DAD) for internet of things (IoT) applications," Future Generation Computer Systems, vol. 93, pp. 156-169, Apr. 2019.F.SabouriF.yaghmaee32201921322210.66224/ijece.28372.16.3.213http://ijece.org/en/Article/28372http://ijece.org/en/Article/Download/28372http://ijece.org/en/Article/Download/28372http://ijece.org/en/Article/Download/28372http://ijece.org/en/Article/Download/28372http://ijece.org/en/Article/Download/28372http://ijece.org/en/Article/Download/28372http://ijece.org/en/Article/Download/28372[1] N. Senthilkumaran and J. Thimmiaraja, "Histogram equalization for image enhancement using MRI brain images," inProc. World Congress on Computing and Communication Technologies WCCCT'14, pp. 80-83, Trichirappalli, India, 27 Feb.- 1 Mar. 2014. [2] V. A. Mateescu and I. V. Bajic, "Visual attention retargeting," IEEE MultiMedia, vol. 23, no. 1, pp. 82-91, Jan. 2016. [3] T. V. Nguyen, et al., "Image re-attentionizing," IEEE Trans. on Multimedia, vol. 15, no. 8, pp. 1910-1919, Dec. 2013. [4] R. Mechrez, E. Shechtman, and L. Zelnik-Manor, "Saliency driven image manipulation," in Proc. Conf. on Applications of Computer Vision, WACV'18, pp. 1368-1376, Lake Tahoe, NV, USA, 12-15 Mar. 2018. [5] A. Borji and L. Itti, "State-of-the-art in visual attention modeling," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 35, no. 1, pp. 185-207, Jan. 2013. [6] F. Sabouri and F. Yaghmaee, "Visual distractors detecting in images using TPTSSR," in Proc. 10th Iranian Conf. on Machine Vision and Image Processing, MVIP'17, pp. 87-92, Isfahan, Iran, 22-23 Nov. 2017. [7] Y. Xu, D. Zhang, J. Yang, and J. Y. Yang, "A two-phase test sample sparse representation method for use with face recognition," IEEE Trans. on Circuits and Systems for Video Technology, vol. 21, no. 9, pp. 1255-1262, Sept. 2011. [8] L. Itti, C. Koch, and E. Niebur, "A model of saliency-based visual attention for rapid scene analysis," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 20, no. 11, pp. 1254-1259, Nov. 1998. [9] A. Oliva and A. Torralba, "Modeling the shape of the scene: a holistic representation of the spatial envelope," International J. of Computer Vision, vol. 42, no. 3, pp. 145-175, May-Jun. 2001. [10] S. Goferman, L. Zelnik-Manor, and A. Tal, "Context-aware saliency detection," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 34, no. 10, pp. 1915-1926, Oct. 2012. [11] A. Borji and L. Itti, "Exploiting local and global patch rarities for saliency detection," in Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, CVPR'12, pp. 478-485, Providence, RI, USA, 16-21 Jun. 2012. [12] R. Margolin, A. Tal, and L. Zelnik-Manor, "What makes a patch distinct?," in Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, pp. 1139-1146, Portland, OR, USA, 23-28 Jun. 2013. [13] Q. Fan and C. Qi, "Saliency detection based on global and local shortterm sparse representation," Neurocomputing, vol. 175, no. ???, pp. 81-89, Oct. 2016. [14] N. Dhavale and L. Itti, "Saliency-based multifoveated MPEG compression," in Proc. 7th Int. Symp. on Signal Processing and Its Applications, vol. 1, pp. 229-232, Paris, France, 4-4 Jul. 2003. [15] C. Guo and L. Zhang, "A novel multiresolution spatiotemporal saliency detection model and its applications in image and video compression," IEEE Trans. on Image Processing, vol. 19, no. 1, pp. 185-198, Jan. 2010. [16] G. Evangelopoulos, K. Rapantzikos, A. Potamianos, P. Maragos, A. Zlatintsi, and Y. Avrithis, "Movie summarization based on audiovisual saliency detection," in Proc. 15th IEEE Int. Conf. on Image Processing, ICIP'08, pp. 2528-2531, San Diego, CA, USA, 12-15 Oct. 2008. [17] D. Simakov, Y. Caspi, E. Shechtman, and M. Irani, "Summarizing visual data using bidirectional similarity," Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, CVPR'08, 8 pp., Anchorage, AK, USA, 23-28 Jun. 2008. [18] L. Zhang, Y. Shen, and H. Li, "VSI: a visual saliency-induced index for perceptual image quality assessment," IEEE Trans. on Image Processing, vol. 23, no. 10, pp. 4270-4281, Oct. 2014. [19] R. Achanta and S. Susstrunk, "Saliency detection for content-aware image resizing," in Proc. 16th IEEE Int. Conf. on Image Processing, ICIP'09, pp. 1005-1008, Cairo, Egypt, 7-10 Nov. 2009. [20] Y. Fang, et al., "Saliency-based stereoscopic image retargeting," Information Sciences, vol. 372, pp. 347-358, 1 Dec. 2016. [21] O. Fried, E. Shechtman, D. B. Goldman, and A. Finkelstein, "Finding distractors in images," in Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, CVPR'15, pp. 1703-1712, Boston, MA, USA, 7-12 Jun. 2015. [22] R. Tibshirani, "Regression shrinkage and selection via the lasso," J. of the Royal Statistical Society, Series B (Methodological), vol. 58, no. 1, pp. 267-288, Jan. 1996. [23] J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 31, no. 2, pp. 210-227, Feb. 2009. [24] Z. Zhang, Y. Xu, J. Yang, X. Li, and D. Zhang, "A survey of sparse representation: algorithms and applications," IEEE Access, vol. 3, pp. 490-530, May 2015. [25] K. Yu, T. Zhang, and Y. Gong, "Nonlinear learning using local coordinate coding," in Proc. of the 22nd International Conference on Neural Information Processing Systems, NIPS’09, pp. 2223-2231, Vancouver, BC, Canada, 7-10 Dec.. 2009. [26] Z. Liu, J. Pu, M. Xu, and Y. Qiu, "Face recognition via weighted two phase test sample sparse representation," Neural Processing Letters, vol. 41, no. 1, pp. 43-53, Jan. 2015. [27] H. Zou and T. Hastie, "Regularization and variable selection via the elastic net," J. of the Royal Statistical Society, Series B (Statistical Methodology), vol. 67, no. 2, pp. 301-320, Aug. 2005. [28] T. Judd, K. Ehinger, F. Durand, and A. Torralba, "Learning to predict where humans look," in Proc. IEEE 12th Int. Conf. on Computer Vision, pp. 2106-2113, Kyoto, Japan, 29 Sept.- 2 Oct. 2009. [29] E. Rosten, R. Porter, and T. Drummond, "Faster and better: a machine learning approach to corner detection," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 32, no. 1, pp. 105-119, Jan. 2010. [30] C. L. Zitnick and P. Dollar, "Edge boxes: locating object proposals from edges," in Proc. European Conf. on Computer Vision, ECCV'14, pp. 391-405, Zurich, Switzerland, 6-12 Sept. 2014. [31] M. M. Cheng, N. J. Mitra, X. Huang, P. H. Torr, and S. M. Hu, "Global contrast based salient region detection," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 37, no. 3, pp. 569-582, Mar. 2015. [32] M. Wang, J. Konrad, P. Ishwar, K. Jing, and H. Rowley, "Image saliency: from intrinsic to extrinsic context," in Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, CVPR'11, pp. 417-424, Colorado Springs, CO, USA, 20-25 Jun. 2011. [33] K. K. Maninis, J. Pont-Tuset, P. Arbelaez, and L. Van Gool, "Convolutional oriented boundaries: from image segmentation to high-level tasks," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 40, no. 4, pp. 819 - 833, Apr. 2018.. [34] Y. Sun, A. K. Wong, and M. S. Kamel, "Classification of imbalanced data: a review," International J. of Pattern Recognition and Artificial Intelligence, vol. 23, no. 4, pp. 687-719, Nov. 2009. [35] X. Li, et al., "DeepSaliency: multi-task deep neural network model for salient object detection," IEEE Trans. on Image Processing, vol. 25, no. 8, pp. 3919-3930, Oct. 2016.S.Rezavandi ShoaiiH.Zare32201922323010.66224/ijece.28373.16.3.223http://ijece.org/en/Article/28373http://ijece.org/en/Article/Download/28373http://ijece.org/en/Article/Download/28373http://ijece.org/en/Article/Download/28373http://ijece.org/en/Article/Download/28373http://ijece.org/en/Article/Download/28373http://ijece.org/en/Article/Download/28373http://ijece.org/en/Article/Download/28373[1] M. Newman, Networks: An Introduction, Oxford, New York: Oxford University Press, 2010. [2] M. Al Hasan, V. Chaoji, S. Salem, and M. Zaki, "Link prediction using supervised learning," in Proc. 4th Workshop on Link Analysis, Counter-Terrorism and Security, SDM’06, 10 pp., 2006. [3] A. Anil, et al., "Link prediction using social network analysis over heterogeneous terrorist network," in Proc. IEEE Int.l Conf. on Smart City/SocialCom/SustainCom (SmartCity), Chengdu, China, 19-21 Dec. 2015. [4] L. M. Aiello, et al., "Friendship prediction and homophily in social media," ACM Trans. Web, vol. 6, no. 2, Article No. 9, Jun. 2012. [5] L. Lu, C. H. Jin, and T. Zhou, "Similarity index based on local paths for link prediction of complex networks," Phys. Rev. E, vol. 80, no. 4, pp. 046122, 26 Oct. 2009. [6] F. Folino and C. Pizzuti, "Link prediction approaches for disease networks," in Proc. Int. Conf. on Information Technology in Bio- and Medical Informatics, ITBAM ‘11, pp. 99-108, Toulouse, France, 31 Aug.- 1 Sept., 2011. [7] N. Rummele, R. Ichise, and H. Werthner, "Exploring supervised methods for temporal link prediction in heterogeneous social networks," in Proc. of the 24th Int. Conf. on World Wide Web, pp. 1363-1368, Florence, Italy, 18-22 May 2015. [8] C. A. Bliss, M. R. Frank, C. M. Danforth, and P. S. Dodds, "An evolutionary algorithm approach to link prediction in dynamic social networks," J. Comput. Sci., vol. 5, no. 5, pp. 750-764, Sept. 2014. [9] P. Wang, B. Xu, Y. Wu, and X. Zhou, "Link prediction in social networks: the state-of-the-art," Sci. China Inf. Sci., vol. 58, no. 1, pp. 1-38, Jan. 2015. [10] F. Liu and S. T. Xia, "Link prediction in aligned heterogeneous networks," in T. Cao, et al. (eds) Advances in Knowledge Discovery and Data Mining, LNCS, vol 9077. pp. 33-44, Springer, Cham, 2015. [11] G. D. Lyu, C. J. Fan, L. F. Yu, B. X. Xiu, and W. M. Zhang, "Predicting missing links via structural similarity," Int. J. Mod. Phys. B, vol. 29, no. 15, Article No. 1550095, Apr. 2015. [12] M. Jalili, Y. Orouskhani, M. Asgari, N. Alipourfard, and M. Perc, "Link prediction in multiplex online social networks," Open Sci., vol. 4, no. 2, Article No. 160863, Feb. 2017. [13] Y. Yang, N. Chawla, Y. Sun, and J. Hani, "Predicting links in multi-relational and heterogeneous networks," in Proc. of the IEEE 12th Int. Conf. on Data Mining, pp. 755-764, Washington, DC, USA, 10-13 Dec. 2012. [14] G. Rossetti, M. Berlingerio, and F. Giannotti, "Scalable link prediction on multidimensional networks," in Proc. IEEE 11th Int. Conf. on Data Mining Workshops, ICDMW’11, pp. 979-986, Vancouver, Canada, 11-11 Dec. 2011. [15] J. Leskovec and J. D. Ullman, Mining of Massive Datasets, 2nd Ed., Cambridge: Cambridge University Press, 2014. [16] D. Liben-Nowell and J. Kleinberg, "The link-prediction problem for social networks," J. Am Soc Inf Sci Technol, vol. 58, no. 7, pp. 1019-1031, May 2007. [17] M. E. J. Newman, "Clustering and preferential attachment in growing networks," Phys. Rev. E, vol. 64, no. 2, 4 pp., Jul. 2001. [18] V. Martinez, F. Berzal, and J. C. Cubero, "A survey of link prediction in complex networks," ACM Comput Surv., vol. 49, Article No. 69, Dec. 2016. [19] T. Sorensen, "A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on danish commons," Biol Skr, vol. 5, pp. 1-34, 1948.v [20] L. Katz, "A new status index derived from sociometric analysis," Psychometrika, vol. 18, no. 1, pp. 39-43, Mar. 1953. [21] F. Fouss, A. Pirotte, J. M. Renders, and M. Saerens, "Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation," IEEE Trans. Knowl. Data Eng., vol. 19, no. 3, pp. 355-369, Mar. 2007. [22] G. Jeh and J. Widom, "SimRank: a measure of structural-context similarity," in Proc. of the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 538-543, Edmonton, Alberta, Canada, 23-26 Jul. 2002. [23] D. Davis, R. Lichtenwalter, and N. V. Chawla, "Multi-relational link prediction in heterogeneous information networks," in Proc. Int. Conf. on Advances in Social Networks Analysis and Mining, pp. 281-288, Kaohsiung, Taiwan, 25-27 Jul. 2011. [24] J. Zhang, P. S. Yu, and Z. H. Zhou, "Meta-path based multi-network collective link prediction," in Proc. of the 20th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 1286-1295, New York, NY, USA, 24-27 Aug. 2014. [25] B. R. Memon and U. K. Wiil, "Predicting links in multi-relational networks," in Proc. IEEE Joint Intelligence and Security Informatics Conf., JISIC’14, pp. 107-114, Hague, The Netherlands, 24-26 Sept. 2014. [26] Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu, "Pathsim: meta path-based top-k similarity search in heterogeneous information networks," in Proc. VLDB Endow., vol. 4, no 11, pp. 992-1003, 2011. [27] J. Tang, T. Lou, and J. Kleinberg, "Inferring social ties across heterogenous networks," in Proc. of the 5th ACM Int. Conf. on Web Search and Data Mining, pp. 743-752, Seattle, Washington, USA, 8-12 Feb. 2012. [28] D. Li, Y. Zhang, Z. Xu, D. Chu, and S. Li, "Exploiting information diffusion feature for link prediction in Sina Weibo," Sci. Rep., vol. 6, Article No. 20058, Jan. 2016. [29] J. Li, B. Ge, K. Yang, Y. Chen, and Y. Tan, "Meta-path based heterogeneous combat network link prediction," Phys. Stat. Mech. Its Appl., vol. 482, no. Supplement C, pp. 507-523, 15 Sep. 2017. [30] M. Pujari and R. Kanawati, "Link prediction in multiplex networks," NHM, vol. 10, no. 1, pp. 17-35, 2015. [31] C. Yang, J. Sun, J. Ma, S. Zhang, G. Wang, and Z. Hua, "Scientific collaborator recommendation in heterogeneous bibliographic networks," in Proc. 48th Hawaii Int. Conf. on System Sciences, HICSS’15, pp. 552-561, Kauai, HI, USA, 5-8 Jan. 2015. [32] L. A. Adamic and E. Adar, "Friends and neighbors on the web," Soc. Netw., vol. 25, no. 3, pp. 211-230, Jul. 2003. [33] The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition, New York, NY: Springer, 2016. [34] K. P. Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012. [35] S. Haykin, Neural Networks: A Comprehensive Foundation, 1st Ed. Upper Saddle River, NJ, USA: Prentice Hall PTR, 1994. [36] C. C. Chang and C. J. Lin, "LIBSVM: a library for support vector machines," ACM Trans. Intell. Syst. Technol. TIST, vol. 2, no. 3, Article No. 27, Apr. 2011. [37] C. Bishop, Pattern Recognition and Machine Learning, New York: Springer, 2007. [38] J. Coleman, E. Katz, and H. Menzel, "The diffusion of an innovation among physicians," Sociometry, vol. 20, no. 4, pp. 253-270, Dec. 1957. [39] M. De Domenico, A. Lancichinetti, A. Arenas, and M. Rosvall, "Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems," Phys. Rev. X 5, arXiv:1408.2925 2015. [40] J. Friedman, T. Hastie, and R. Tibshirani, The Elements of Statistical Learning, 2nd Ed., Berlin: Springer Series in Statistics, 2011. [41] M. Ranjbar, P. Moradi, M. Azami, and M. Jalili, "An imputation-based matrix factorization method for improving accuracy of collaborative filtering systems," Eng. Appl. Artif. Intell., vol. 46, Issue A, pp. 58-66, Nov. 2015.v [42] L. Yao, L. Wang, L. Pan, and K. Yao, "Link prediction based on common-neighbors for dynamic social network," in Proc. 7th Int. Conf. Ambient Syst. Netw. Technol. ANT 2016 6th Int. Conf. Sustain. Energy Inf. Technol. SEIT-2016 Affil. Workshop, vol. 83, Supplement C, pp. 82-89, Jan. 2016. [43] Y. Dong, N. V. Chawla, and A. Swami, "Metapath2Vec: scalable representation learning for heterogeneous networks," in Proc. of the 23rd ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 135-144, Halifax, NS, Canada, 13-17 Aug. 2017. [44] E. Zhong, E. W. Xiang, W. Fan, N. N. Liu, and Q. Yang, Friendship Prediction in Composite Social Networks, ArXiv Prepr. ArXiv: 14024033, 2014. [45] B. Pachev and B. Webb, Fast Link Prediction for Large Networks Using Spectral Embedding, ArXiv Prepr. ArXiv: 1703.09693, 2017.AbdolrezaVaghefiMahdiMollamotalebi32201923123810.66224/ijece.28374.16.3.231http://ijece.org/en/Article/28374http://ijece.org/en/Article/Download/28374http://ijece.org/en/Article/Download/28374http://ijece.org/en/Article/Download/28374http://ijece.org/en/Article/Download/28374http://ijece.org/en/Article/Download/28374http://ijece.org/en/Article/Download/28374http://ijece.org/en/Article/Download/28374[1] M. T. Thai, F. Wang, D. Hongwei Du, and X. Jia, "Coverage problems in wireless sensor networks: designs and analysis," International J. of Sensor Networks, vol. 3, no. 3, pp. 191-200, May 2008. [2] S. Kumar and D. Lobiyal, "Sensing coverage prediction for wireless sensor networks in shadowed and multipath environment," The Scientific World J., vol. vol. 2013, Article No. 565419, 11 pages, Oct. 2013. [3] A. Hossain, S. Chakrabarti, and P. Biswas, "Impact of sensing model on wireless sensor network coverage," IET Wireless Sensor Systems, vol. 2, no. 3, pp. 272-281, Sept. 2012. [4] J. Yua, X. Denga, D. Yuc, G. Wangd, and X. Gua, "CWSC: connected k-coverage working sets construction algorithm in wireless sensor networks," J. of Electronics and Communications, vol. 67, no. 11, pp. 937-946, Nov. 2013. [5] C. Huang and Y. Tseng, "The coverage problem in a wireless sensor network," J. Mobile Networks and Applications, vol. 10, no. 4, pp. 519-528, Aug. 2005. [6] G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated coverage and connectivity configuration for energy conservation in sensor networks," J. ACM Trans. on Sensor Networks (TOSN), vol. 1, no. 1, pp. 36-72, Aug. 2005. [7] C. Huang, Y. Tseng, and L. Lo, "The coverage problem in three-dimensional wireless sensor networks," J. of Interconnection Networks, vol. 08, no. 03, pp. 209-227, Sept. 2007. [8] X. Zhang and C. Wang, "Distributed k-coverage verification algorithm based on localized distance information in WSNs," in Proc. of the IEEE Int. Conf. on Networking, Architecture, and Storage, pp. 196-199, Hunan, China, 9-11 Jul. 2009. [9] Y. Bejerano, "Coverage verification without location information," J. IEEE Trans. on Mobile Computing Archive, vol. 11, no. 4, pp. 631-643, May 2012. [10] H. L. Wang and W. H. Chung, "The generalized k-coverage under probabilistic sensing model in sensor networks," in Proc.IEEE Wireless Communications and Networking Conf., WCNC'12, pp. 1737-1742, Shanghai, China, 1-4 Apr. 2012. [11] X. Shen, J. Chen, and Y. Sun, "Grid scan: a simple and effective approach for coverage issue in wireless sensor networks," in Proc. of the IEEE Int. Conf. on Communications, ICC'06, vol. 8, pp. 3480-3484, Istanbul, Turkey, 11-15 Jun. 2006. [12] J. Sheu, G. Chang, S. Wu, and Y. Chen, "Adaptive k-coverage contour evaluation and deployment in wireless sensor networks," J. ACM Trans. on Sensor Networks, vol. 9, no. 4, Article No. 40, 31 pp., Jul. 2013. [13] K. Juang, E. Wang, C. Chiang, and A. Chen, "Verification of k-coverage on query line segments," in Proc. of the 17th Int.Database Engineering & Applications Symp., pp. 114-121, Barcelona, Spain, 9-13 Oct. 2013. [14] A. So and Y. Ye, "On solving coverage problems in a wireless sensor network using voronoi diagrams," in Proc. of Workshop on Internet and Network Economics, WINE'05, pp. 584-593, Hong Kong, China, 15-17 Dec. 2005. [15] Y. Zou and K. Chakrabarty, "Uncertainty-aware and coverage-oriented deployment for sensor networks," J. Parallel and Distributed Computing, vol. 64, no. 7, pp. 788-798, Jul. 2004. [16] S. Patnaik, X. Li, and Y. Yang, Recent Development in Wireless Sensor and Ad-hoc Networks, Springer, 2015. [17] M. Boudali, M. Senouci, M. Aissani, and W. Hidouci, "Activities scheduling algorithms based on probabilistic coverage models for wireless sensor networks," Annals of Telecommunications, vol. 72, no. 3, pp. 221-232, Apr. 2017. [18] M. Fernandez and S. Williams, "Closed-form expression for the Poisson-binomial probability density function," IEEE Trans. on Aerospace and Electronic Systems, vol. 46, no. 2, pp. 803-817, Apr. 2010. [19] Y. Hong, "On computing the distribution function for the Poisson binomial distribution," Computational Statistics & Data Analysis, vol. 59, no. 1, pp. 41-51, Mar. 2013. [20] W. Hoeffding, "On the distribution of the number of successes in independent trials," the Annals of Mathematical Statistics, vol. 27, no. 3, pp. 713-721, Sept. 1956. [21] W. Wang, On the Number of Successes in Independent Trials, Statistica Sinica, pp. 295-312, 1993. [22] R. Hamming, The Art of Probability: for Scientists and Engineers, Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA, 1991. [23] S. Ross, Introduction to Probability Models, 11th Edition, Academic Press, Inc. Orlando, FL, USA, 2014. [24] B. Bowerman, R. O'Connell, and A. Koehler, Forecasting, Time Series, and Regression: An Applied Approach, Thomson Brooks/Cole, 2005.Z.KarimiS.Shiry GhidaryR.Ramezani32201923924610.66224/ijece.28375.16.3.239http://ijece.org/en/Article/28375http://ijece.org/en/Article/Download/28375http://ijece.org/en/Article/Download/28375http://ijece.org/en/Article/Download/28375http://ijece.org/en/Article/Download/28375http://ijece.org/en/Article/Download/28375http://ijece.org/en/Article/Download/28375http://ijece.org/en/Article/Download/28375[1] J. Lu, X. Zhou, Y. P. Tan, Y. Shang, and J. Zhou, "Neighborhood repulsed metric learning for kinship verification," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 36, no. 2, pp. 331-345, Feb. 2014. [2] J. Yu, M. Wang, and D. Tao, "Semisupervised multiview distance metric learning for cartoon synthesis," IEEE Trans. on Image Processing, vol. 21, no. 11, pp. 4636-4648, Nov. 2012. [3] B. Kulis, "Metric learning: a survey," Foundations and Trends in Machine Learning, vol. 5, no. 4, pp. 287-364, 2012. [4] Y. Ying and P. Li, "Distance metric learning with eigenvalue optimization," J. of Machine Learning Research, vol. 13, no. 1, pp. 1-26, Jan. 2012. [5] L. K. Saul and S. T. Roweis, "Think globally, fit locally: unsuper-learning of low dimensional manifolds," the J. of Machine Learning Research, vol. 4, pp. 119-155, 12 Jan. 2003. [6] J. B. Tenenbaum, V. De Silva, and J. C. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, no. 5500, pp. 2319-2323, 22 Dec. 2000. [7] Z. Zhang and H. Zha, "Principal manifolds and nonlinear dimensionality reduction via tangent space alignment," SIAM J. on Scientific Computing, vol. 26, no. 1, pp. 313-338, 2004. [8] M. Belkin and P. Niyogi, "Laplacian eigenmaps for dimensionality reduction and data representation," Neural Computation, vol. 15, no. 6, pp. 1373-1396, 1 Jun. 2003. [9] J. Wang, X. Sun, and J. Du, "Local tangent space alignment via nuclear norm regularization for incomplete data," Neurocomputing, vol. 273, pp. 141-151, 17 Jan. 2018. [10] M. A. Carreira-Perpin and Z. Lu, "Manifold learning and missing data recovery through unsupervised regression," in Proc. IEEE 11th Int. Conf. on Data Mining, ICDM’11, pp. 1014-1019, Vancouver, Canada, 11-14 Dec. 2011. [11] N. Pitelis, C. Russell, and L. Agapito, "Learning a manifold as an atlas," in Proc. IEEE Conf. on Computer Vision and Pattern Recognition, CVPR’13, pp. 1642-1649, Portland, OR, USA, 23-28 Jun. 2013. [12] X. Wang, T. Peter, and A. F. Mark, "Multiple manifolds learning framework based on hierarchical mixture density model," in Proc. Joint European Conf. on Machine Learning and Knowledge Discovery in Databases, pp. 566-581, Antwerp, Belgium, 15-19 Sept. 2008. [13] K. Q. Weinberger and L. K. Saul, "Distance metric learning for large margin nearest neighbor classification," The J. of Machine Learning Research, vol. 10, pp. 207-244, 12 Jan. 2009. [14] M. Der and L. K. Saul, "Latent coincidence analysis: a hidden variable model for distance metric learning," in Proc. 25th Int. Conf. on Neural Information Processing Systems, vol. 2, pp. 3230-3238, Lake Tahoe, NV, US, 3-6 Dec. 2012. [15] S. C. Hoi, W. Liu, and S. F. Chang, "Semi-supervised distance metric learning for collaborative image retrieval and clustering," ACM Trans. on Multimedia Computing, Communications, and Applications, vol. 6, no. 3, pp. 18-43, Aug. 2010. [16] W. Liu, S. Ma, D. Tao, J. Liu, and P. Liu, "Semi-supervised sparse metric learning using alternating linearization optimization," in Proc. Int. 16th Conf. on Knowledge Discovery and Data Mining, ACMSIGKDD’10, pp. 1139-1148, Washington, DC, US, 25-28 Jul. 2010. [17] M. Baghshah and S. Shouraki, "Semi-supervised metric learning using pairwise constraints," in Proc. of the 21st Int. Joint Conf. on Artificial Intelligence, pp. 1217-1222, Pasadena, CA, US, 11-17 Jul. 2009. [18] G. Niu, B. Dai, M. Yamada, and M. Sugiyama, "Information-theoretic semisupervised metric learning via entropy regularization," Neural Computation, vol. 26, no. 8, pp. 1717-1762, Aug. 2012. [19] Q. Wang, P. C. Yuen, and G. Feng, "Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions," Pattern Recognition, vol. 46, no. 9, pp. 2576-2587, Sept. 2013. [20] R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification, John Wiley and Sons, 2001. [21] L. Yang and R. Jin, Distance Metric Learning: A Comprehensive Survey, Michigan State Universiy, 2006. [22] M. Belkin, Q. Que, Y. Wang, and X. Zhou, "Toward understanding complex spaces: graph laplacians on manifolds with singularities and boundaries," in Proc. 25th Annual Conf. on Learning Theory, COLT’12, pp. 1-26, Edinburgh, Scotland, 2012. [23] Z. Karimi and S. Shiry Ghidary, "Semi-Supervised Classification in Stratified Spaces by Considering Non-interior Points Using Laplacian Behavior," Neurocomputing, vol. 239, pp. 223-231, 24 May 2017. [24] L. Vandenberghe and S. Boyd, "Semidefinite programming," SIAM Review, vol. 38, no. 1, pp. 49-95, Mar. 1996. [25] M. Belkin, P. Niyogi, and V. Sindhwani, "Manifold regularization: a geometric framework for learning from labeled and unlabeled examples," J. of Machine Learning Research, vol. 7, pp. 2399-2434, Nov. 2006.