Available online at ScienceDirect. Procedia Computer Science 98 (2016 )
|
|
- Melvyn Mitchell
- 6 years ago
- Views:
Transcription
1 Available online at ScienceDirect Procedia Computer Science 98 (016 ) The 3rd International Symposium on Emerging Information, Communication and Networks (EICN 016) Finding User Groups in Social Networks Using Ant Cemetery Waseem Shahzad a *, Sana Qamber b a Department of Computer Science, National University of Computer and Emerging Sciences, A.K.Brohi Road, H-11/4, Islamabad, 44000, Pakistan b Department of Computer Science, National University of Computer and Emerging Sciences, A.K.Brohi Road, H-11/4, Islamabad, 44000, Pakistan Abstract Clustering plays a major role in data mining. It helps in identifying patterns and distribution of data. In this paper, we propose ant colony optimization (ACO) based clustering algorithm for clustering the social network data. The proposed technique takes advantage of Ants cemetery and allows each ant to play a role. In every iteration, the ants produce a cluster for the data, and the pheromone values are updated after every iteration of all the ants. The experiment results show that proposed technique discovered the clusters which reveal the truthfulness of the network. We have also compared the proposed technique with another state of the art clustering algorithm, and experimental result demonstrated that proposed technique find out the better clusters. 016 The The Authors. Published by by Elsevier Elsevier B.V. B.V. This is an open access article under the CC BY-NC-ND license ( Peer-review under responsibility of the Conference Program Chairs. Peer-review under responsibility of the Program Chairs Keywords: Ant colony optimization; ant cemetery; Social media; clustering 1. Introduction Networks are of many types; they include a social network, web network, biological networks and others 1. The network is considered as a graph and finding a community in network means to find a subgraph based on connectivity. Functions are used to find dense and sparse connections. In social networks nodes represent people, and nodes are connected by an edge showing if they are linked or not. Community detection helps in understanding the structure of the community 1. It is a clustering problem, and clustering strategies are applied to divide the data * Corresponding author. Tel.: ; fax: address: waseem.shahzad@nu.edu.pk The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license ( Peer-review under responsibility of the Program Chairs doi: /j.procs
2 Waseem Shahzad and Sana Qamber / Procedia Computer Science 98 ( 016 ) instances into some natural groups. In clustering process, instances are grouped in such a way that similar objects are grouped to be in one group 1. Aim is to have clusters that are sparsely connected with other clusters but are densely connected within a cluster. Ant Colony Algorithm (ACO) is inspired by the movement of ants 3. Marco Dorigo first proposed it in It is an algorithm used for finding the optimal solution. ACO has been used for social network clustering and has shown good results 7. There are many other clustering algorithms, but experiments with real and artificial datasets have proved that ACO is a better clustering algorithm as it has provided better results 5. Its chance of getting stuck at local optima is less 6. Previously algorithms have been developed but they do not consider multiple attributes. For this purpose we have proposed our technique for the unsupervised dataset and it is based on ant colony optimization technique. The technique is novel and can handle multiple attribute based dataset. It takes advantage of Ants cemetery and allows each ant to play a role. All ants have the opportunity to update pheromone value based on the solution that is developed. The rest of the paper is structured as follows; Section contains details of related work, applications of clustering by using ant colony optimization. Section 3 discusses the details of our proposed technique. Comparison with other algorithms and results are in section 4. Conclusion and future aspect in the last section 5.. Related Work Data that seems meaningless and hard to understand is made meaningful and easy to comprehend by clustering. Data is closely analyzed, and patterns are determined. Clustering is very useful in almost every field 8, medicine 9, library, insurance, earthquake, websites and marketing. A modified technique of ant colony optimization for community detection using modularity Q as the objective function 1. It is different from other techniques as is in this ants, do not search for candidate solution but in every step checks if current vertex joins the previous. Thus, the solution provided is checking locally. No pheromone is used in this technique. Weak points are it is a locally optimized solution. The network consists of nodes and edges. They do not consider attribute values. The main algorithm is to take each community as a vertex and initially randomly distribute ants. A methodology that is based on community division, it allows mixing the link and node attribute information. The main aim of this paper is to find companies that have done more than two projects together. The dataset consists of members of all the projects and information of each company. Strong points are system has been practically implemented and tested on FP6 database. It caters multiple attributes but does not use ACO and is not implemented on a social network. Clustering is performed by similarity 3. The objective of this paper is to find maximum subgroups from the structure. The major distinguishing factor from the normal ant colony algorithm is that the path on which the ant moves in the proposed algorithm is a vertex, and the pheromone is deposited on vertex rather than moving by an edge sequence. It is tested on Orkut data set; the member is represented by nodes and if any communication by the message is exchanged it is represented by a vertex. Previously instance based search was used in which a biased search may lead to a suboptimal wrong solution. It does not use multiple attributes. Ant colony optimization, model-based search has been used to find clusters in social network 10. Solution is made by using probabilistic models. The methodology includes dividing the graph into two sub graphs. This division process is repeated until no further increase in modularity is achieved. Graph only shows the connectivity, no importance is given to the individual attribute. A new algorithm based on ant colony optimization to detect community in networks 11. Artificial ants are used in this algorithm to construct a solution for community detection. College Football graph, vertices show different teams and presence of edge tells that match has been played between the teams. Larger the pheromone on the path, greater is the probability of its selection. Weak points are that it doesn t consider multiple attributes of the networks. Multiple relations that exist between users are used for clustering of social networks 1. A random walk is performed on each user. The drawback is if a graph is disconnected the walk will just rotate around the starting point and will not converge. Thus, the solution becomes biased. Mark 13 provides a fast algorithm for detecting community in a network. The main idea is modularity, to check the quality of a community. The drawback is that this algorithm is very costly and is good for only small networks. The community is detected based on multiple attributes 14. Similarity-based algorithm is proposed by the authors. The system has been tested on a Chinese social network known as Renren. But the drawback is that it uses a small number of users and doesn t perform on large datsets. The algorithm does not use ant colony algorithm for finding community in a social network. Algorithm 15 is based on fitness perception and pheromone diffusion. The technique uses ant colony algorithm for clustering. In this algorithm, each node is considered as a community. The drawback is the use of random selection as it may lead to wrong results. Random selection is known to be very costly. For its proper
3 550 Waseem Shahzad and Sana Qamber / Procedia Computer Science 98 ( 016 ) working, all possibilities and lists must be present and calculated beforehand. So that values could be randomly selected from it. A well-known technique for clustering is K-Mean clustering 16. The number of clusters to be created in the algorithm is specified in the initialization step. The k mean clustering method is simple and effective in producing good results. It is very obvious that choosing the cluster center to be the centroid minimizes the total squared distance from each of the clusters points to its center. It is not a suitable for social network clustering as it does not guarantee optimal solution. The related work shows that in the past algorithm using Ant colony algorithm that caters multiple attributes on a social network has not been developed thus our focus is to develop an algorithm considering these aspects. 3. Proposed Technique 3.1. Data Collection and Representation Databases are available online for social network clustering, but they are mostly single attribute based. The online databases for social networking are a few. We have collected our own database from Facebook using scraping. It includes the data of more than 3000 users, their likes and a wide number of categories are extracted. The input dataset is represented in the matrix form with a size equal to N x M where N denotes the number of Users in the data set, and M represents the features/attributes or dimensions of each data item. The dataset is in the form of numerals. 3.. Reducing Complex network Ants, unlike humans, do not have preplanned routines. Incase ants die they do not have a specific location for the dead ants. They clean their nest and during cleaning they pick the dead ants known as corpses and put them aside. The dead is picked up or not by using picking probability equation 1. A value close to one means that the current surrounding has few corpses thus it needs to be picked and placed in another location where there are higher numbers of corpses. Once its picked now where to drop the corpse is based on dropping probability equation. A value close to one means high probability to be dropped in the current location. This means that the current location has high number corpses in the surrounding. In our algorithm, the dead ants that need to be scattered in the subspace are the data set points which are scattered in the subspace. Ant Cemetery process is performed. Picking probability K Close to 1 pick (1) 1 P p K1 f Dropping probability f Close to 1 drop () P d K f Algorithm Proposed Algorithm 1. Input Dataset for the network. Transformation Adjacency Matrix 3. Initialization Number of ants, max number of iterations T, 4. Ant Cemetery Nodes randomly distributed, Ant cemetery algorithm initialized, Groups formed and result forwarded. 5. Pheromone Calculation
4 Waseem Shahzad and Sana Qamber / Procedia Computer Science 98 ( 016 ) Pheromone value is calculated and updated. Following formula has been used for calculation. P. v k. (3) In equation 3, P is the probability of the th i data that belongs to j th cluster. is the amount of pheromone on edge between, is the heuristic value calculated by 1 (4) X 6. Cluster creation Euclidean distance is calculated and clusters are formed. Equation 5 has been used for distance calculation. d p, q q i p i n i1 7. Objective Function Calculation Intra cluster distance calculated using equation 6. d n c k i1, x i c p (6) ( i) 8. Best Solution In every iteration clusters formed and compared with previous solution. Best solution saved based on objective function 9. Iterations run for T number T is the maximum number of iterations taken as Experimentation Experiments are performed on our datasets, and we have evaluated the results according to the cluster validation process. The dataset used for experimentation is extracted from Facebook. The users are not related; the experiment does not become biased. Clustering is purely done by the similarity of the attributes of the users. The experimental results validate the performance of the proposed approach and show that our approach is more accurate in providing clustering of social website data. The program for proposed algorithm is written in MATLAB (R011a) and run on an Intel Pentium 370M with.00gb memory. We have compared the performance of our algorithm with some other clustering algorithm ACCFP [15] and KMEAN [16]. Our algorithm has provided better results as compared to the mentioned clustering techniques Discussion Algorithm ACCFP as described in the related work section states to produce good results, but its drawback is the use of random selection as it may lead to wrong results. Random selection is known to be very costly. For its proper working, all possibilities and its lists must be present and calculated beforehand. So that values could be randomly selected from it. The K-Mean algorithm has no guarantee that it will converge in the global minimum; it can also converge to the local minimum depending upon its initial cluster centers. Small changes in the initial choice of cluster centers may result into entirely different solution. Thus, it is not a suitable way for clustering. The reasons ACCFP algorithm and K-Mean algorithm are used for comparison are that ACCFP is one of latest papers, and it states to have a good result. K-Mean is the widely known and used an algorithm for clustering purpose. To find the best K value that is the number of clusters that should be created in K-Means algorithm, the Elbow method is used. Elbow method uses the sum of square. The main concept is to select such value of k that if further K value is increased it doesn t further give good modeling for the dataset. Fig. 1 shows the value of the sum of the square of (5)
5 55 Waseem Shahzad and Sana Qamber / Procedia Computer Science 98 ( 016 ) the y-axis and number of clusters that is the value of K on the x-axis. The figure shows that the sum of square decreases abruptly as the value of K increases. But after the value of K 10 sum of the square doesn t decrease abruptly. 1.8 Sum of Squares Sum of Square Sum of Square Intra cluster distance Proposed Algo ACCFP K Cluster No. Fig. 1 Sum of Square Fig. Intra Cluster distance Fig. shows results, ACCFP algorithm, and our proposed algorithm is compared. The results show that the average intra-cluster distance is high when comparing the ACCFP algorithm and our proposed algorithm. As shown in the figure the blue and red line are close but mostly the red line is above the blue line showing that the ACCFP algorithm has higher intra-cluster distance value as compared to proposed algorithm This shows that our proposed algorithm has better results compared to ACCFP. Though our algorithm and ACCFP are quite close, our algorithm has performed better. The reason that our algorithm has performed better that the existing algorithm is that we have incorporated the use of ant cemetery along with Ant colony algorithm. Suitable values of ants and other parameters have been used that makes the proposed algorithm perform better than the existing algorithms. Fig 3 shows the interpretation of the results obtained from the proposed algorithm. The figure illustrates the clusters and the attributes. The X axis shows the attribute and y-axis show the value. Colored bars show the presences of the attribute in the cluster. The first cluster 1, in this cluster it shows that the majority attributes are 4, 5, 6 and 8 as they are the colored bars. A display of total 1 clusters is shown, showing the good performance of the proposed algorithm. Fig. 3Interpretation of Clusters
6 Waseem Shahzad and Sana Qamber / Procedia Computer Science 98 ( 016 ) Conclusion Discovering hidden patterns from a dataset is part of computational intelligence. The unsupervised dataset is classified in clustering. Clustering plays a major role in data mining. It helps in identifying patterns and distribution of data. Clustering is performed on the unsupervised dataset. It partitions the data by following the trends in the dataset. Recently ant colony algorithm has been providing good results with clustering problems. Clustering using Ant cemetery and Ant Colony Optimization has the advantage over other methods that it has the capability to explore the dataset. It tries to find the global optima and protects itself from converging into local optima. The main aim of this paper is to develop an efficient ACO based clustering algorithm which can cluster the social network dataset by handling multiple attributes. The dataset used is unsupervised. Pheromone update is allowed by all ants. A combination of ant cemetery and ant colony algorithm is used. In the clustering of the social network, the clusters that are formed should be closely related and have maximum similarities in them thus the objective function of intra distance is used to know the amount compactness in the clusters formed. Distance values show that the proposed algorithm has less intra-cluster distance as compared to the state of the art clustering algorithms. The lesser the intracluster distance, the better it is for the algorithm. Thus, the proposed technique finds better clusters and can produce optimal clusters which reveal the truthfulness of the network. As per future work, more efficient heuristic measure can be determined to improve the performance of proposed algorithm further. Some alternative mechanism can be searched for updating pheromone values further to improve the convergence mechanism and quality of the solution. References 1. D. He, J Liu, D. Liu, D. Jin, and Z. Jia. "Ant colony optimization for community detection in large-scale complex networks."in Natural Computation ICNC, Seventh International Conference IEEE, vol, 011 p S. Lozano, J. Duch, and A. Arenas. "Community detection in a large social dataset of european projects." Counterterrorism and Security (SIAM) on Data mining, M. Al-Fayoumi, S. Banerjee, and P. K. Mahanti. "Analysis of social network using clever ant colony metaphor." World Academy of Science, Engineering and Technology vol 5, 009, p V. Ganapathy, T. T. Jia Jie, and S. Parasuraman. "Improved Ant Colony Optimization for robot navigation." Mechatronics and its Applications (ISMA), 7th International Symposium on IEEE, 010, p A. P. Engelbrecht, Computational intelligence: an introduction, John Wiley & Sons, nd Edition, T. A. Runkler. "Ant colony optimization of clustering models."international Journal of Intelligent Systems vol 0.1, 005, p M. Halkidi, Y. Batistakis, and M.V, "On Clustering Validation Techniques," Journal of Intelligent Information Systems, vol. 17, 001, p P. Berkhin, "A survey of clustering data mining techniques." Grouping multidimensional data. Springer Berlin Heidelberg, 006, p U. Alon,N. Barkai, D. Notterman, K. Gish, S. Ybarra, D. Mack, & A. Levine, Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proceedings of the National Academy of Sciences, vol 96, no.1, 1999, p S. R. Mandala, S. R.T. Kumara, C. R. Rao, and R. Albert. "Clustering social networks using ant colony optimization.", vol 13, 013, p B. Chen, L. Chen, and Y. Chen. "Detecting community structure in networks based on ant colony optimization." In International Conference on Information & Knowledge Engineering, 01, p M. Gjoka, C. T. Butts, M. Kurant, and A. Markopoulou. "Multigraph sampling of online social networks." Selected Areas in Communications, IEEE Journal vol 9, 011, p M. E. Newman, "Fast algorithm for detecting community structure in networks." Physical review vol 69.6, D. Li, L. Ma, Q. Yu, Y. Zhao, and Y. Mao. "A community detection algorithm based on the multi-attribute similarity." In Communications, Circuits and Systems IEEE (ICCCAS), vol. 1, 013, p X. Song, J.Junzhong, C.Yang, & X. Zhang, Ant colony clustering based on sampling for community detection, In Evolutionary Computation (CEC), IEEE, 014, p M. E. Celebi, H. A. Kingravi, & P. A. Vela, A comparative study of efficient initialization methods for the k-means clustering algorithm. Journal of Expert Systems with Applications, Elsevier, vol 40.1, 013, p
SOMSN: An Effective Self Organizing Map for Clustering of Social Networks
SOMSN: An Effective Self Organizing Map for Clustering of Social Networks Fatemeh Ghaemmaghami Research Scholar, CSE and IT Dept. Shiraz University, Shiraz, Iran Reza Manouchehri Sarhadi Research Scholar,
More informationAvailable online at ScienceDirect. Procedia Computer Science 89 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 89 (2016 ) 341 348 Twelfth International Multi-Conference on Information Processing-2016 (IMCIP-2016) Parallel Approach
More informationA Naïve Soft Computing based Approach for Gene Expression Data Analysis
Available online at www.sciencedirect.com Procedia Engineering 38 (2012 ) 2124 2128 International Conference on Modeling Optimization and Computing (ICMOC-2012) A Naïve Soft Computing based Approach for
More informationDynamic Clustering of Data with Modified K-Means Algorithm
2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Dynamic Clustering of Data with Modified K-Means Algorithm Ahamed Shafeeq
More informationText clustering based on a divide and merge strategy
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 55 (2015 ) 825 832 Information Technology and Quantitative Management (ITQM 2015) Text clustering based on a divide and
More informationUnsupervised learning on Color Images
Unsupervised learning on Color Images Sindhuja Vakkalagadda 1, Prasanthi Dhavala 2 1 Computer Science and Systems Engineering, Andhra University, AP, India 2 Computer Science and Systems Engineering, Andhra
More informationAn Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm
An Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm Prabha S. 1, Arun Prabha K. 2 1 Research Scholar, Department of Computer Science, Vellalar
More informationCHAPTER 5 OPTIMAL CLUSTER-BASED RETRIEVAL
85 CHAPTER 5 OPTIMAL CLUSTER-BASED RETRIEVAL 5.1 INTRODUCTION Document clustering can be applied to improve the retrieval process. Fast and high quality document clustering algorithms play an important
More informationAnt Colonies, Self-Organizing Maps, and A Hybrid Classification Model
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 7th, 2004 Ant Colonies, Self-Organizing Maps, and A Hybrid Classification Model Michael L. Gargano, Lorraine L. Lurie, Lixin Tao,
More informationFuzzy Ant Clustering by Centroid Positioning
Fuzzy Ant Clustering by Centroid Positioning Parag M. Kanade and Lawrence O. Hall Computer Science & Engineering Dept University of South Florida, Tampa FL 33620 @csee.usf.edu Abstract We
More informationSolving Travelling Salesmen Problem using Ant Colony Optimization Algorithm
SCITECH Volume 3, Issue 1 RESEARCH ORGANISATION March 30, 2015 Journal of Information Sciences and Computing Technologies www.scitecresearch.com Solving Travelling Salesmen Problem using Ant Colony Optimization
More informationCHAPTER 4 K-MEANS AND UCAM CLUSTERING ALGORITHM
CHAPTER 4 K-MEANS AND UCAM CLUSTERING 4.1 Introduction ALGORITHM Clustering has been used in a number of applications such as engineering, biology, medicine and data mining. The most popular clustering
More informationThree-Dimensional Reconstruction from Projections Based On Incidence Matrices of Patterns
Available online at www.sciencedirect.com ScienceDirect AASRI Procedia 9 (2014 ) 72 77 2014 AASRI Conference on Circuit and Signal Processing (CSP 2014) Three-Dimensional Reconstruction from Projections
More informationOutlier Detection and Removal Algorithm in K-Means and Hierarchical Clustering
World Journal of Computer Application and Technology 5(2): 24-29, 2017 DOI: 10.13189/wjcat.2017.050202 http://www.hrpub.org Outlier Detection and Removal Algorithm in K-Means and Hierarchical Clustering
More informationCHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION
CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION 6.1 INTRODUCTION Fuzzy logic based computational techniques are becoming increasingly important in the medical image analysis arena. The significant
More informationImprovement of SURF Feature Image Registration Algorithm Based on Cluster Analysis
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Improvement of SURF Feature Image Registration Algorithm Based on Cluster Analysis 1 Xulin LONG, 1,* Qiang CHEN, 2 Xiaoya
More informationHybrid of Genetic Algorithm and Continuous Ant Colony Optimization for Optimum Solution
International Journal of Computer Networs and Communications Security VOL.2, NO.1, JANUARY 2014, 1 6 Available online at: www.cncs.org ISSN 2308-9830 C N C S Hybrid of Genetic Algorithm and Continuous
More informationA New Approach for Shape Dissimilarity Retrieval Based on Curve Evolution and Ant Colony Optimization
Proc. Int. Conf. on Recent Trends in Information Processing & Computing, IPC A New Approach for Shape Dissimilarity Retrieval Based on Curve Evolution and Ant Colony Optimization Younes Saadi 1, Rathiah
More informationANALYZING AND OPTIMIZING ANT-CLUSTERING ALGORITHM BY USING NUMERICAL METHODS FOR EFFICIENT DATA MINING
ANALYZING AND OPTIMIZING ANT-CLUSTERING ALGORITHM BY USING NUMERICAL METHODS FOR EFFICIENT DATA MINING Md. Asikur Rahman 1, Md. Mustafizur Rahman 2, Md. Mustafa Kamal Bhuiyan 3, and S. M. Shahnewaz 4 1
More informationMobile Robot Path Planning in Static Environments using Particle Swarm Optimization
Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization M. Shahab Alam, M. Usman Rafique, and M. Umer Khan Abstract Motion planning is a key element of robotics since it empowers
More informationNavigation of Multiple Mobile Robots Using Swarm Intelligence
Navigation of Multiple Mobile Robots Using Swarm Intelligence Dayal R. Parhi National Institute of Technology, Rourkela, India E-mail: dayalparhi@yahoo.com Jayanta Kumar Pothal National Institute of Technology,
More informationProcedia Computer Science
Procedia Computer Science 3 (2011) 530 536 Procedia Computer Science 00 (2010) 000 000 Procedia Computer Science www.elsevier.com/locate/procedia www.elsevier.com/locate/procedia WCIT-2010 Extraction of
More informationScienceDirect. Plan Restructuring in Multi Agent Planning
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 46 (2015 ) 396 401 International Conference on Information and Communication Technologies (ICICT 2014) Plan Restructuring
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 3, March 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Special Issue:
More informationSequences Modeling and Analysis Based on Complex Network
Sequences Modeling and Analysis Based on Complex Network Li Wan 1, Kai Shu 1, and Yu Guo 2 1 Chongqing University, China 2 Institute of Chemical Defence People Libration Army {wanli,shukai}@cqu.edu.cn
More informationSolving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques N.N.Poddar 1, D. Kaur 2 1 Electrical Engineering and Computer Science, University of Toledo, Toledo, OH, USA 2
More informationAn Enhanced K-Medoid Clustering Algorithm
An Enhanced Clustering Algorithm Archna Kumari Science &Engineering kumara.archana14@gmail.com Pramod S. Nair Science &Engineering, pramodsnair@yahoo.com Sheetal Kumrawat Science &Engineering, sheetal2692@gmail.com
More informationAvailable online at ScienceDirect. Procedia Technology 17 (2014 )
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 17 (2014 ) 528 533 Conference on Electronics, Telecommunications and Computers CETC 2013 Social Network and Device Aware Personalized
More informationAvailable online at ScienceDirect. Procedia Computer Science 59 (2015 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 59 (2015 ) 419 426 International Conference on Computer Science and Computational Intelligence (ICCSCI 2015) Degree Centrality
More informationAvailable online at ScienceDirect. Procedia CIRP 44 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia CIRP 44 (2016 ) 102 107 6th CIRP Conference on Assembly Technologies and Systems (CATS) Worker skills and equipment optimization in assembly
More informationOptimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO
Optimization of Makespan and Mean Flow Time for Job Shop Scheduling Problem FT06 Using ACO Nasir Mehmood1, Muhammad Umer2, Dr. Riaz Ahmad3, Dr. Amer Farhan Rafique4 F. Author, Nasir Mehmood is with National
More informationA Memetic Heuristic for the Co-clustering Problem
A Memetic Heuristic for the Co-clustering Problem Mohammad Khoshneshin 1, Mahtab Ghazizadeh 2, W. Nick Street 1, and Jeffrey W. Ohlmann 1 1 The University of Iowa, Iowa City IA 52242, USA {mohammad-khoshneshin,nick-street,jeffrey-ohlmann}@uiowa.edu
More informationThe Artificial Bee Colony Algorithm for Unsupervised Classification of Meteorological Satellite Images
The Artificial Bee Colony Algorithm for Unsupervised Classification of Meteorological Satellite Images Rafik Deriche Department Computer Science University of Sciences and the Technology Mohamed Boudiaf
More informationCommunity Detection: Comparison of State of the Art Algorithms
Community Detection: Comparison of State of the Art Algorithms Josiane Mothe IRIT, UMR5505 CNRS & ESPE, Univ. de Toulouse Toulouse, France e-mail: josiane.mothe@irit.fr Karen Mkhitaryan Institute for Informatics
More informationANT COLONY OPTIMIZATION FOR FINDING BEST ROUTES IN DISASTER AFFECTED URBAN AREA
ANT COLONY OPTIMIZATION FOR FINDING BEST ROUTES IN DISASTER AFFECTED URBAN AREA F Samadzadegan a, N Zarrinpanjeh a * T Schenk b a Department of Geomatics Eng., University College of Engineering, University
More informationAn Intelligent Clustering Algorithm for High Dimensional and Highly Overlapped Photo-Thermal Infrared Imaging Data
An Intelligent Clustering Algorithm for High Dimensional and Highly Overlapped Photo-Thermal Infrared Imaging Data Nian Zhang and Lara Thompson Department of Electrical and Computer Engineering, University
More informationClustering in Data Mining
Clustering in Data Mining Classification Vs Clustering When the distribution is based on a single parameter and that parameter is known for each object, it is called classification. E.g. Children, young,
More informationFuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem
Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem Bindu Student, JMIT Radaur binduaahuja@gmail.com Mrs. Pinki Tanwar Asstt. Prof, CSE, JMIT Radaur pinki.tanwar@gmail.com Abstract
More informationInternet Traffic Classification Using Machine Learning. Tanjila Ahmed Dec 6, 2017
Internet Traffic Classification Using Machine Learning Tanjila Ahmed Dec 6, 2017 Agenda 1. Introduction 2. Motivation 3. Methodology 4. Results 5. Conclusion 6. References Motivation Traffic classification
More informationAvailable online at ScienceDirect. Procedia Computer Science 96 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 96 (2016 ) 1409 1417 20th International Conference on Knowledge Based and Intelligent Information and Engineering Systems,
More informationAvailable online at ScienceDirect. Procedia Technology 24 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 24 (2016 ) 1120 1126 International Conference on Emerging Trends in Engineering, Science and Technology (ICETEST - 2015) FPGA
More informationClustering of Data with Mixed Attributes based on Unified Similarity Metric
Clustering of Data with Mixed Attributes based on Unified Similarity Metric M.Soundaryadevi 1, Dr.L.S.Jayashree 2 Dept of CSE, RVS College of Engineering and Technology, Coimbatore, Tamilnadu, India 1
More informationRandomized Response Technique in Data Mining
Randomized Response Technique in Data Mining Monika Soni Arya College of Engineering and IT, Jaipur(Raj.) 12.monika@gmail.com Vishal Shrivastva Arya College of Engineering and IT, Jaipur(Raj.) vishal500371@yahoo.co.in
More informationAvailable online at ScienceDirect. Procedia Computer Science 96 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 96 (2016 ) 946 950 20th International Conference on Knowledge Based and Intelligent Information and Engineering Systems
More informationHybrid ant colony optimization algorithm for two echelon vehicle routing problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 3361 3365 Advanced in Control Engineering and Information Science Hybrid ant colony optimization algorithm for two echelon vehicle
More informationDSP-Based Parallel Processing Model of Image Rotation
Available online at www.sciencedirect.com Procedia Engineering 5 (20) 2222 2228 Advanced in Control Engineering and Information Science DSP-Based Parallel Processing Model of Image Rotation ZHANG Shuang,2a,2b,
More informationFirst approach to solve linear system of equations by using Ant Colony Optimization
First approach to solve linear system equations by using Ant Colony Optimization Kamil Ksia z ek Faculty Applied Mathematics Silesian University Technology Gliwice Poland Email: kamiksi862@studentpolslpl
More informationGene Expression Based Classification using Iterative Transductive Support Vector Machine
Gene Expression Based Classification using Iterative Transductive Support Vector Machine Hossein Tajari and Hamid Beigy Abstract Support Vector Machine (SVM) is a powerful and flexible learning machine.
More informationScienceDirect. Analogy between immune system and sensor replacement using mobile robots on wireless sensor networks
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 35 (2014 ) 1352 1359 18 th International Conference in Knowledge Based and Intelligent Information & Engineering Systems
More informationANANT COLONY SYSTEMFOR ROUTING IN PCB HOLES DRILLING PROCESS
International Journal of Innovative Management, Information & Production ISME International c2013 ISSN 2185-5439 Volume 4, 1, June 2013 PP. 50-56 ANANT COLONY SYSTEMFOR ROUTING IN PCB HOLES DRILLING PROCESS
More informationA Partition Method for Graph Isomorphism
Available online at www.sciencedirect.com Physics Procedia ( ) 6 68 International Conference on Solid State Devices and Materials Science A Partition Method for Graph Isomorphism Lijun Tian, Chaoqun Liu
More informationComparative Study Of Different Data Mining Techniques : A Review
Volume II, Issue IV, APRIL 13 IJLTEMAS ISSN 7-5 Comparative Study Of Different Data Mining Techniques : A Review Sudhir Singh Deptt of Computer Science & Applications M.D. University Rohtak, Haryana sudhirsingh@yahoo.com
More informationTask Scheduling Using Probabilistic Ant Colony Heuristics
The International Arab Journal of Information Technology, Vol. 13, No. 4, July 2016 375 Task Scheduling Using Probabilistic Ant Colony Heuristics Umarani Srikanth 1, Uma Maheswari 2, Shanthi Palaniswami
More informationA Monotonic Sequence and Subsequence Approach in Missing Data Statistical Analysis
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 1 (2016), pp. 1131-1140 Research India Publications http://www.ripublication.com A Monotonic Sequence and Subsequence Approach
More informationImproved Performance of Unsupervised Method by Renovated K-Means
Improved Performance of Unsupervised Method by Renovated P.Ashok Research Scholar, Bharathiar University, Coimbatore Tamilnadu, India. ashokcutee@gmail.com Dr.G.M Kadhar Nawaz Department of Computer Application
More informationUsing Decision Boundary to Analyze Classifiers
Using Decision Boundary to Analyze Classifiers Zhiyong Yan Congfu Xu College of Computer Science, Zhejiang University, Hangzhou, China yanzhiyong@zju.edu.cn Abstract In this paper we propose to use decision
More informationDatasets Size: Effect on Clustering Results
1 Datasets Size: Effect on Clustering Results Adeleke Ajiboye 1, Ruzaini Abdullah Arshah 2, Hongwu Qin 3 Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang 1 {ajibraheem@live.com}
More informationIteration Reduction K Means Clustering Algorithm
Iteration Reduction K Means Clustering Algorithm Kedar Sawant 1 and Snehal Bhogan 2 1 Department of Computer Engineering, Agnel Institute of Technology and Design, Assagao, Goa 403507, India 2 Department
More informationScienceDirect. Image Segmentation using K -means Clustering Algorithm and Subtractive Clustering Algorithm
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 54 (215 ) 764 771 Eleventh International Multi-Conference on Information Processing-215 (IMCIP-215) Image Segmentation
More informationIntroduction to Machine Learning CMU-10701
Introduction to Machine Learning CMU-10701 Clustering and EM Barnabás Póczos & Aarti Singh Contents Clustering K-means Mixture of Gaussians Expectation Maximization Variational Methods 2 Clustering 3 K-
More informationConcept Tree Based Clustering Visualization with Shaded Similarity Matrices
Syracuse University SURFACE School of Information Studies: Faculty Scholarship School of Information Studies (ischool) 12-2002 Concept Tree Based Clustering Visualization with Shaded Similarity Matrices
More informationUnderstanding Clustering Supervising the unsupervised
Understanding Clustering Supervising the unsupervised Janu Verma IBM T.J. Watson Research Center, New York http://jverma.github.io/ jverma@us.ibm.com @januverma Clustering Grouping together similar data
More informationA Data Classification Algorithm of Internet of Things Based on Neural Network
A Data Classification Algorithm of Internet of Things Based on Neural Network https://doi.org/10.3991/ijoe.v13i09.7587 Zhenjun Li Hunan Radio and TV University, Hunan, China 278060389@qq.com Abstract To
More informationClassification Using Unstructured Rules and Ant Colony Optimization
Classification Using Unstructured Rules and Ant Colony Optimization Negar Zakeri Nejad, Amir H. Bakhtiary, and Morteza Analoui Abstract In this paper a new method based on the algorithm is proposed to
More informationOptimization using Ant Colony Algorithm
Optimization using Ant Colony Algorithm Er. Priya Batta 1, Er. Geetika Sharmai 2, Er. Deepshikha 3 1Faculty, Department of Computer Science, Chandigarh University,Gharaun,Mohali,Punjab 2Faculty, Department
More informationAN IMPROVED HYBRIDIZED K- MEANS CLUSTERING ALGORITHM (IHKMCA) FOR HIGHDIMENSIONAL DATASET & IT S PERFORMANCE ANALYSIS
AN IMPROVED HYBRIDIZED K- MEANS CLUSTERING ALGORITHM (IHKMCA) FOR HIGHDIMENSIONAL DATASET & IT S PERFORMANCE ANALYSIS H.S Behera Department of Computer Science and Engineering, Veer Surendra Sai University
More informationInternational Journal of Scientific Research & Engineering Trends Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): X
Analysis about Classification Techniques on Categorical Data in Data Mining Assistant Professor P. Meena Department of Computer Science Adhiyaman Arts and Science College for Women Uthangarai, Krishnagiri,
More informationAn Efficient Clustering for Crime Analysis
An Efficient Clustering for Crime Analysis Malarvizhi S 1, Siddique Ibrahim 2 1 UG Scholar, Department of Computer Science and Engineering, Kumaraguru College Of Technology, Coimbatore, Tamilnadu, India
More informationComparative Study of Subspace Clustering Algorithms
Comparative Study of Subspace Clustering Algorithms S.Chitra Nayagam, Asst Prof., Dept of Computer Applications, Don Bosco College, Panjim, Goa. Abstract-A cluster is a collection of data objects that
More informationUnsupervised Learning : Clustering
Unsupervised Learning : Clustering Things to be Addressed Traditional Learning Models. Cluster Analysis K-means Clustering Algorithm Drawbacks of traditional clustering algorithms. Clustering as a complex
More informationA heuristic approach to find the global optimum of function
Journal of Computational and Applied Mathematics 209 (2007) 160 166 www.elsevier.com/locate/cam A heuristic approach to find the global optimum of function M. Duran Toksarı Engineering Faculty, Industrial
More informationOnline Social Networks and Media. Community detection
Online Social Networks and Media Community detection 1 Notes on Homework 1 1. You should write your own code for generating the graphs. You may use SNAP graph primitives (e.g., add node/edge) 2. For the
More informationAvailable online at ScienceDirect. Procedia Computer Science 89 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 89 (2016 ) 778 784 Twelfth International Multi-Conference on Information Processing-2016 (IMCIP-2016) Color Image Compression
More informationK-Means Clustering Using Localized Histogram Analysis
K-Means Clustering Using Localized Histogram Analysis Michael Bryson University of South Carolina, Department of Computer Science Columbia, SC brysonm@cse.sc.edu Abstract. The first step required for many
More informationKeywords: clustering algorithms, unsupervised learning, cluster validity
Volume 6, Issue 1, January 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Clustering Based
More informationEnhancing K-means Clustering Algorithm with Improved Initial Center
Enhancing K-means Clustering Algorithm with Improved Initial Center Madhu Yedla #1, Srinivasa Rao Pathakota #2, T M Srinivasa #3 # Department of Computer Science and Engineering, National Institute of
More informationAn Abnormal Data Detection Method Based on the Temporal-spatial Correlation in Wireless Sensor Networks
An Based on the Temporal-spatial Correlation in Wireless Sensor Networks 1 Department of Computer Science & Technology, Harbin Institute of Technology at Weihai,Weihai, 264209, China E-mail: Liuyang322@hit.edu.cn
More informationAvailable online at ScienceDirect. Procedia Computer Science 82 (2016 ) 28 34
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 82 (2016 ) 28 34 Symposium on Data Mining Applications, SDMA2016, 30 March 2016, Riyadh, Saudi Arabia Finding similar documents
More informationAnalysis of K-Means Clustering Based Image Segmentation
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 2, Ver.1 (Mar - Apr.2015), PP 01-06 www.iosrjournals.org Analysis of K-Means
More informationAn Efficient QBIR system using Adaptive segmentation and multiple features
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 87 (2016 ) 134 139 2016 International Conference on Computational Science An Efficient QBIR system using Adaptive segmentation
More informationNetwork community detection with edge classifiers trained on LFR graphs
Network community detection with edge classifiers trained on LFR graphs Twan van Laarhoven and Elena Marchiori Department of Computer Science, Radboud University Nijmegen, The Netherlands Abstract. Graphs
More informationAvailable online at ScienceDirect. Procedia Computer Science 56 (2015 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 56 (2015 ) 266 270 The 10th International Conference on Future Networks and Communications (FNC 2015) A Context-based Future
More informationLOAD BALANCING IN CLOUD COMPUTING USING ANT COLONY OPTIMIZATION
International Journal of Computer Engineering & Technology (IJCET) Volume 8, Issue 6, Nov-Dec 2017, pp. 54 59, Article ID: IJCET_08_06_006 Available online at http://www.iaeme.com/ijcet/issues.asp?jtype=ijcet&vtype=8&itype=6
More informationA *69>H>N6 #DJGC6A DG C<>C::G>C<,8>:C8:H /DA 'D 2:6G, ()-"&"3 -"(' ( +-" " " % '.+ % ' -0(+$,
The structure is a very important aspect in neural network design, it is not only impossible to determine an optimal structure for a given problem, it is even impossible to prove that a given structure
More informationCLUSTERING. CSE 634 Data Mining Prof. Anita Wasilewska TEAM 16
CLUSTERING CSE 634 Data Mining Prof. Anita Wasilewska TEAM 16 1. K-medoids: REFERENCES https://www.coursera.org/learn/cluster-analysis/lecture/nj0sb/3-4-the-k-medoids-clustering-method https://anuradhasrinivas.files.wordpress.com/2013/04/lesson8-clustering.pdf
More informationScienceDirect. Differential Search Algorithm for Multiobjective Problems
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 48 (2015 ) 22 28 International Conference on Intelligent Computing, Communication & Convergence (ICCC-2015) (ICCC-2014)
More informationSwarm Based Fuzzy Clustering with Partition Validity
Swarm Based Fuzzy Clustering with Partition Validity Lawrence O. Hall and Parag M. Kanade Computer Science & Engineering Dept University of South Florida, Tampa FL 33620 @csee.usf.edu Abstract
More informationA Totally Astar-based Multi-path Algorithm for the Recognition of Reasonable Route Sets in Vehicle Navigation Systems
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and Behavioral Scien ce s 96 ( 2013 ) 1069 1078 13th COTA International Conference of Transportation Professionals (CICTP 2013)
More informationAvailable online at ScienceDirect. Procedia Computer Science 79 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 79 (2016 ) 483 489 7th International Conference on Communication, Computing and Virtualization 2016 Novel Content Based
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationAnt Colony Optimization for dynamic Traveling Salesman Problems
Ant Colony Optimization for dynamic Traveling Salesman Problems Carlos A. Silva and Thomas A. Runkler Siemens AG, Corporate Technology Information and Communications, CT IC 4 81730 Munich - Germany thomas.runkler@siemens.com
More informationPASS EVALUATING IN SIMULATED SOCCER DOMAIN USING ANT-MINER ALGORITHM
PASS EVALUATING IN SIMULATED SOCCER DOMAIN USING ANT-MINER ALGORITHM Mohammad Ali Darvish Darab Qazvin Azad University Mechatronics Research Laboratory, Qazvin Azad University, Qazvin, Iran ali@armanteam.org
More informationParticle Swarm Optimization applied to Pattern Recognition
Particle Swarm Optimization applied to Pattern Recognition by Abel Mengistu Advisor: Dr. Raheel Ahmad CS Senior Research 2011 Manchester College May, 2011-1 - Table of Contents Introduction... - 3 - Objectives...
More informationRobot localization method based on visual features and their geometric relationship
, pp.46-50 http://dx.doi.org/10.14257/astl.2015.85.11 Robot localization method based on visual features and their geometric relationship Sangyun Lee 1, Changkyung Eem 2, and Hyunki Hong 3 1 Department
More informationA Novel Approach for Minimum Spanning Tree Based Clustering Algorithm
IJCSES International Journal of Computer Sciences and Engineering Systems, Vol. 5, No. 2, April 2011 CSES International 2011 ISSN 0973-4406 A Novel Approach for Minimum Spanning Tree Based Clustering Algorithm
More informationData Clustering Hierarchical Clustering, Density based clustering Grid based clustering
Data Clustering Hierarchical Clustering, Density based clustering Grid based clustering Team 2 Prof. Anita Wasilewska CSE 634 Data Mining All Sources Used for the Presentation Olson CF. Parallel algorithms
More informationDiffusion and Clustering on Large Graphs
Diffusion and Clustering on Large Graphs Alexander Tsiatas Thesis Proposal / Advancement Exam 8 December 2011 Introduction Graphs are omnipresent in the real world both natural and man-made Examples of
More informationOverlapping Community Detection in Social Networks Using Parliamentary Optimization Algorithm
Overlapping Community Detection in Social Networks Using Parliamentary Optimization Algorithm Feyza Altunbey Firat University, Department of Software Engineering, Elazig, Turkey faltunbey@firat.edu.tr
More informationTOWARDS NEW ESTIMATING INCREMENTAL DIMENSIONAL ALGORITHM (EIDA)
TOWARDS NEW ESTIMATING INCREMENTAL DIMENSIONAL ALGORITHM (EIDA) 1 S. ADAEKALAVAN, 2 DR. C. CHANDRASEKAR 1 Assistant Professor, Department of Information Technology, J.J. College of Arts and Science, Pudukkottai,
More informationOptimized Coverage and Efficient Load Balancing Algorithm for WSNs-A Survey P.Gowtham 1, P.Vivek Karthick 2
Optimized Coverage and Efficient Load Balancing Algorithm for WSNs-A Survey P.Gowtham 1, P.Vivek Karthick 2 1 PG Scholar, 2 Assistant Professor Kathir College of Engineering Coimbatore (T.N.), India. Abstract
More information