SAACO: Semantic Analysis based Ant Colony Optimization Algorithm for Efficient Text Document Clustering
|
|
- Geraldine Short
- 5 years ago
- Views:
Transcription
1 SAACO: Semantic Analysis based Ant Colony Optimization Algorithm for Efficient Text Document Clustering 1 G. Loshma, 2 Nagaratna P Hedge 1 Jawaharlal Nehru Technological University, Hyderabad 2 Vasavi College of Engineering, Hyderabad Abstract Text document clustering has gained substantial research interest, owing to the rate of data growth. This paper presents a new text clustering algorithm namely Semantic Analysis based Ant Colony Optimization algorithm (SAACO). This entire work is decomposed into several phases such as document pre-processing, similarity measure computation, semantic analysis, application of clustering algorithm and cluster labelling. The preprocessing step aims at removing stop words, performing stemming operation and representing documents in a suitable format. The similarity measure computation is performed by the cosine similarity measure. The semantic analysis is performed by the exploitation of the WordNet. This is followed by the application of SAACO algorithm and finally, the cluster is labelled. The experimental results of the proposed algorithm are satisfactory with maximum accuracy rate. Keywords Text document clustering, WordNet, ant colony optimization algorithm. I. INTRODUCTION Data plays the vital role in all the domains and it grows hand-in-hand with time. Thus, the data management is the complex task to be achieved. The main concern of data management is hassle-free search and retrieval of the required data. At this juncture, the concept of clustering is beneficial. The main objective of a clustering algorithm is to group data, which are similar to each other. The degree of similarity of documents within a cluster is more, which when compared to the degree of similarity between documents from other clusters. This process of clustering makes the retrieval and search processes easier. Besides this, all the manipulations can be done effectively, as the related data are clustered together. This work aims at clustering the text documents by exploiting external knowledge base namely WordNet and the clustering algorithm being employed is the Ant Colony Optimization (ACO) algorithm. The proposed work is divided into four stages. The first stage is responsible for pre-processing, in order to make the documents appropriate for further processing of data. The second stage aims at computing the similarity of the data. The actual clustering operation is performed in the third stage. Finally, the clustered documents are labelled, in order to achieve easier retrievability. The rest of the paper is organised as follows. Section 2 reviews the related literature on text document clustering. Section 3 presents the proposed algorithm for clustering. The proposed algorithm is tested for its effectiveness in the section 4. Finally, the concluding remarks are presented in section 5. II. BACKGROUND This section intends to review the foundational concepts of the proposed text clustering algorithms. 2.1 WordNet WordNet is one of the largest thesauruses of English language. It connects all the terms to relevant terms, with respect to their meaning. It contains synonyms and the relationship of terms. WordNet 2.1 consists of 1,55,327 words in 1,17,597 senses. Synset is a technical term of WordNet, which aggregates nouns, verbs, adjectives and adverbs to form synonym set. This lexical database is employed for text clustering applications to improve the accuracy based on semantics [1]. 2.2 Ant Colony Optimization algorithm Ant Colony Optimization (ACO) algorithm was initially introduced by M. Dorigo and team in early 19s [2-4]. ACO algorithm is a bio-inspired algorithm, which imitates the behaviour of ants. It is based on the idea that the ants roam around the surrounding area of their nests, in order to obtain best food source. The ants check for the quality and the quantity of the food source, as soon as a food source is located. The so verified food source is then brought to the nest. During this backward locomotion, the ants implant the pheromone trail all along the way. The quantity of pheromone deposit depends on the quality and quantity of the food. The concentration of pheromone determines the quality of the food source. This pheromone trail paves way for the discovery of shortest path between the nest and food source. The primary component of ACO algorithm is the pheromone and these values are updated over iterations. The ants establish the solutions for the given problem at every round, on the basis of pheromone. The local search procedure is then applied to the established 21
2 solutions. This is followed by the process of pheromone update. The proposed text clustering algorithm relies on the semantic analysis and the ACO algorithm. III. PROPOSED ALGORITHM This section proposes a new text clustering algorithm that is based on semantic analysis and ACO algorithm. The entire algorithm is classified into several phases such as pre-processing, text document representation, text document clustering and labelling. The overall flow of the proposed algorithm is presented in fig Pre-processing Data pre-processing is the preliminary step which makes the data ready to be processed further. This preprocessing step enhances the speed of the execution of the clustering algorithm. Some of the major preprocessing tasks are removing stop words and perform stemming operation. Stop words are the words that do not have meaning on their own. Instead, they are meaningful only when it is read with the sentence or text. In other words, the stop words are included to enrich the grammatical context. Some of the stop words are articles, prepositions, conjunctions, pronouns and so on. The sample stop words are listed in table 1. Table 1: Sample stop words List of stop words A Before Till To An After With For The Put Without Further Up Of During You Above Off Include Me Down On Exclude I Below In Neither Myself Across Out Nor Around Beside Towards Either Behind Aside Over Or Beneath Because Under And Underneath Become Until Not Into After the process of eliminating the stop words, the proposed work strives to perform stemming operation. Stemming operation can be defined as the clipping of words in order to arrive at the root of the word. This Fig 1: Overall flow of SAACO operation saves memory and reduces the boosts up the speed of the algorithm Stemming operation with Porter-Stemmer algorithm The Porter-Stemmer algorithm is exploited for performing the stemming operation. The main advantages of this algorithm are the following. documents are claimed to be similar if those documents 22 This algorithm eliminates the plural suffix The suffixes ed, -ing are removed The ending alphabet is turned to i from y. Clips suffixes such as full, -ness, -ant, -ence etc., When the ending alphabet is e, the value is removed. Some of the samples are listed below. Example 1: Ants ant; Possesses - Possess Example 2: Presented - Present Example 3: Furry Furri, Really - Realli Example 4: Playful Play, Completeness Complete Example 5: Precedent Preced Example 6: Bearable Bearabl Thus, the pre-processing step deals with removing stop words and stemming operation is performed. This preprocessing step enhances the execution speed of the algorithm and saves memory by avoiding unwanted words [5]. 3.2 Text document representation The text documents are represented in such a way that the documents are represented as vectors. Two
3 have high degree of correlation between them. All the documents are organised as vectors in the vector space as matrix. The term weights of all documents are given by doc i = wt 1i, wt 2i,.. wt hi (4) Where doc i is the specific document, wt 1i is the weight of first term in the i th document, wt hi is the weight of the h th term in the i th document. Vdoc i = {wt 1,i, wt 2,i,.. wt h,i } (5) Equation 5 notifies the vector space model of the documents. wt 1,i, wt 2,i are the term weights of the documents and are computed by wt h,i = tf h IDF (6) IDF = log ( Doc docf h ) (7) tf h is the occurrence frequency of h in the i th document, docf h is the total count of documents that possesses the term h, Doc is the total number of documents in the dataset. The weight of the document is fixed on the basis of the importance of term. However, the above equations from 4 to 7 focus on the occurrence frequency of the terms alone. This work formulates the vector space model by taking the semantic of the term into account and is presented below. 3.3 Semantic similarity The semantic similarity between terms is computed by the incorporation of WordNet [6-10]. WordNet is a lexical database which accumulates the terms called as synsets. The semantical relationship between terms is calculated by taking the semantic correlation between the terms. Every word is checked for the semantic relationship of another word in WordNet. Let α h1,h2 is the semantic relationship between two terms wd 1 and wd 2. In case, if wd 2 is present in the synset of wd 1, then α h1,h2 is set to 1; otherwise α h1,h2 is set to 0 and is represented in (8). wd 2 wd 1 α h1,h2 = 1 wd 2 wd 1 α h1,h2 = 0 (8) The weight wd ij1 of term t i1 in document doc x is given by (9). wd ij1 = wd ij1 + i h2=1 α h1,h2 h2 h1 wd ij2 (9) By this way, the semantic relationship between every pair of terms is computed. This is followed by the computation of similarity measure. This work exploits the cosine similarity between the documents and is presented in (10, 11). Sim Doc a, Doc b = cosine Doc a, Doc b (10) cosine Doc a, Doc b = n i=1 wd ij 1 wd ij 2 n wd 2 i=1 ij 1.wd ij 2 2, a (11) Thus, the semantic similarity between the terms and the documents are found out. This step is followed by the process of clustering. 3.4 Clustering algorithm This work proposes a bio-inspired text clustering algorithm that is based on Ant Colony Optimization algorithm. ACO algorithm mimics the behaviour of real ants. In this work, the clusters are formed by the ACO algorithm. The algorithm is efficient in providing results. The algorithm is presented below. 1. Initialize the algorithm parameters 2. Pre-process the documents 3. Assign the population of food sources in a random fashion 4. Calculate the fitness of the population by (12) 5. Do 6. For each forward ant 7. Store the address of food source in memory; 8. Select next hop by (13); 8. Calculate fitness of the food source; 9. Update the pheromone; 10. Discard the ant when it reaches the source point; 11. Save the best food source; 12. while (termination condition not met); Algorithm description Step 1: The first step is concerned with the initialization of parameters such as the maximum iteration count, maximum time bound for algorithm execution, centre point of the cluster. This algorithm takes the similarity measure as the fitness function of the ACO algorithm. Step 2: The document pre-processing as explained in the previous section is performed in this step. Stopping and stemming is performed in this work. Step 3: The fitness function of ACO algorithm is computed by the following equation. n cl=1 dc s ϵcm i (12) f i = dc s CM i 2 Where cl is the cluster, CM is the cluster midpoint and dc is the document. This equation computes the distance between the document and cluster midpoint. Step 4: As soon as the fitness is computed, new food source is searched for by the ants. These ants strive to provide a new high quality food source from their neighbourhood locations. Suppose, if the similarity between the new document and the cluster midpoint is greater which when compared to the previous execution, then the new document is loaded into the memory. Step 5: This step concerns with the computation of the probability function and is provided in (13). The 23
4 Precision Rate (%) International Journal of Recent Advances in Engineering & Technology (IJRAET) probability rate of an ant z to start from source s and destination d is provided below. p z s, d = (13) [T(s,d)] 0.5 [E(d)] 0.5 u M _z[t(s,u)] 0.5 [E(u)] 0.5 if d M_z 0 otherwise Where p z s, d is the probability rate of z to traverse from location s to d. T is the routing table of each node that saves the concentration of pheromone from s to d. E is the visibility function, which can be computed by (11). Step 6: The ant becomes backward ant b and the pheromone is updated along its path and is loaded in memory. The ant selects the document on the basis of the probability function and it strives to find a suitable document in its neighbourhood. In case of the detection of a document in the neighbouring location, the similarity between the documents is computed. The best solution is found out and stored in memory. This process is repeated until the stopping criterion is met. Step 7: The amount of pheromone is calculated by T z = 1 N td z ; Here, N is the total number of documents and td f is the distance travelled by forward ant z. Step 8: When the backward ant is back to the source node s from d, then the routing table is updated by the following p z s, d = 1 ρ p z s, d + T z (14) Where ρ is the coefficient and 1 ρ indicates the evaporation of trail, since the last updated version of p z s, d. 6. When the ant reaches the node at which its journey started, the goal is attained and the ant is eliminated. After several iterations, the node can identify the most similar documents and cluster them together. 3.5 Cluster labelling The cluster labelling is the most important step, which makes the entire cluster understandable with a single keyword. Thus, a meaningful cluster label is always preferable, which gives sense to the complete cluster. The cluster label is always chosen with a distinctive keyword. The distinct words from the documents of a cluster are collected. This is followed by the computation of the self-explanatory score, which can be computed with the help of the WordNet. Finally, the term with the high self-explanatory score is chosen as the cluster label. 4. Experimental Analysis This section evaluates the performance of the proposed algorithm in terms of precision rate, recall rate, F- measure, accuracy and misclassification rate. The proposed work is compared with the outcome of k- means, bisecting k-means and UPGMA algorithms. The proposed work which is based on semantic analysis proves accurate results. The dataset being exploited for evaluating the performance of the proposed work is Reuters R8, which has got 8 classes [11]. On the whole, the dataset contains 7674 documents, which consists of 5485 training documents and 2189 testing documents. The experimental results are presented in graphical format from fig 2 to 6. Precision rate: Precision rate is the total number of documents whose actual label is x, but misclassified with label y. P rate = do c xy do c y 100 (14) Where doc xy is the total number of documents with actual label x, but wrongly classified as y. doc y is the documents which as correctly labelled as y. Thus, a clustering algorithm works well with greater precision rates Fig 2: Precision rate analysis From the experimental results, it is evident that the proposed work shows the maximum precision rate of 97.2%. This proves that the proposed algorithm efficiently clusters the documents than the other comparative algorithms. Recall rate: Recall rate is the total number of documents whose actual label is x, but misclassified with label y. R rate Precision Rate = do c xy do c x 100 (15) Where doc xy is the total number of documents with actual label x, but wrongly classified as y. doc x is the documents which as correctly labelled as x. Thus, a clustering algorithm works well with greater recall rates. 24
5 Misclassification rate Recall Rate (%) Accuracy (%) International Journal of Recent Advances in Engineering & Technology (IJRAET) Recall Rate Accuracy Rate Fig 3: Recall rate analysis The recall rate analysis shows that the recall rate of the proposed work is 96.5%. This shows that the misplacement of the document inside irrelevant clusters is prevented. F-measure: F-measure is computed by taking precision and recall rate into account. F-measure of a cluster and a class is given by F cls, cltr = 2 P rate R rate P rate +R rate 100 (16) Fig 4: F-measure analysis The greater the value of F-measure, the higher is the quality of the cluster. On observing the experimental results, the proposed work shows the maximum quality of cluster with 96.4%. Accuracy rate: The accuracy rate of the algorithm is determined by the sum of correctly clustered documents and the correctly rejected documents (as they are not relevant) to the total number of clustered documents. acc = ccd +crd total clustered documents F-measure Analysis (17) Fig 5: Accuracy rate The accuracy rate of the proposed work is comparatively better than other algorithms, whereby the objective of the work is fulfilled. Misclassification rate: Misclassification rate is the rate of wrong clustering of documents. The misclassification rate must relatively be low and is calculated by mis rate = 1 acc (18) Fig 6: Misclassification rate analysis Thus, the misclassification rate of the proposed work is the least, which when compared with all the other algorithms. Thus, the Semantic analysis based ACO (SAACO) algorithm is presented which shows maximum accuracy and the least misclassification rate. V. CONCLUSION This paper presents a new text document clustering algorithm namely SAACO which is based on semantic analysis and Ant Colony Optimization algorithm. As the algorithm relies on the semantic analysis along with the ACO algorithm, it proves the greatest accuracy rate and the quality of the clusters is very high. The performance of the algorithm is compared with the existing algorithms and the experimental outcome of the proposed algorithm is satisfactory. REFERENCES [1] Liu, Y., Scheuermann, P., Li, X., and Zhu, X Using WordNet to Disambiguate Word Senses for Text Classification. In Workshop on Text Data Mining in conjunction with 7 th Misclassification Rate
6 International Conference on Computational Science. [2] M. Dorigo, Optimization, learning and natural algorithms (in Italian), Ph.D. Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, [3] M. Dorigo, V. Maniezzo, A. Colorni, Positive feedback as a search strategy, Tech. Report , Dipartimento di Elettronica, Politecnico di Milano, Italy, [4] M. Dorigo, V. Maniezzo, A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Trans. Systems, Man, Cybernet.-Part B 26 (1) (1996) [5] Porter, Martin F. "An algorithm for suffix stripping." Program 14.3 (19): [6] D. Hindle, Noun classification from predicateargument structures, Proc. of the Annual meeting of the association for computational linguistics, pp , 19. [7] S. Caraballo, Automatic construction of a hypernym based noun hierarch from text, Proc. of the Annual meeting of the association for computational linguistics, pp , [8] P. Velardi, R. Fabriani, and M. Missikoff, Using text processing techniques to automatically enrich a domain ontology, Proc. of the international conference on Formal ontology in information systems, pp , [9] P. Cimiano, A. Hotho, and S. Staab, Learning concept hierarchies from text corpora using formal concept analysis, Journal of Artificial Intelligence Research, 24 (2005), pp [10] C. Fellbaum, WordNet: an electronic lexical database, MIT Press., [11] of-reuters html. 26
SEMANTIC ANALYSIS BASED TEXT CLUSTERING BY THE FUSION OF BISECTING K-MEANS AND UPGMA ALGORITHM
SEMANTIC ANALYSIS BASED TEXT CLUSTERING BY THE FUSION OF BISECTING K-MEANS AND UPGMA ALGORITHM G. Loshma 1 and Nagaratna P. Hedge 2 1 Jawaharlal Nehru Technological University, Hyderabad, India 2 Vasavi
More informationAdaptive Model of Personalized Searches using Query Expansion and Ant Colony Optimization in the Digital Library
International Conference on Information Systems for Business Competitiveness (ICISBC 2013) 90 Adaptive Model of Personalized Searches using and Ant Colony Optimization in the Digital Library Wahyu Sulistiyo
More informationKNAPSACK BASED ACCS INFORMATION RETRIEVAL FRAMEWORK FOR BIO-MEDICAL LITERATURE USING SIMILARITY BASED CLUSTERING APPROACH.
KNAPSACK BASED ACCS INFORMATION RETRIEVAL FRAMEWORK FOR BIO-MEDICAL LITERATURE USING SIMILARITY BASED CLUSTERING APPROACH. 1 K.Latha 2 S.Archana 2 R.John Regies 3 Dr. Rajaram 1 Lecturer of Information
More informationA Comprehensive Analysis of using Semantic Information in Text Categorization
A Comprehensive Analysis of using Semantic Information in Text Categorization Kerem Çelik Department of Computer Engineering Boğaziçi University Istanbul, Turkey celikerem@gmail.com Tunga Güngör Department
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 informationImage Edge Detection Using Ant Colony Optimization
Image Edge Detection Using Ant Colony Optimization Anna Veronica Baterina and Carlos Oppus Abstract Ant colony optimization (ACO) is a population-based metaheuristic that mimics the foraging behavior of
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 informationWEIGHTING QUERY TERMS USING WORDNET ONTOLOGY
IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.4, April 2009 349 WEIGHTING QUERY TERMS USING WORDNET ONTOLOGY Mohammed M. Sakre Mohammed M. Kouta Ali M. N. Allam Al Shorouk
More informationSense-based Information Retrieval System by using Jaccard Coefficient Based WSD Algorithm
ISBN 978-93-84468-0-0 Proceedings of 015 International Conference on Future Computational Technologies (ICFCT'015 Singapore, March 9-30, 015, pp. 197-03 Sense-based Information Retrieval System by using
More informationTERM BASED WEIGHT MEASURE FOR INFORMATION FILTERING IN SEARCH ENGINES
TERM BASED WEIGHT MEASURE FOR INFORMATION FILTERING IN SEARCH ENGINES Mu. Annalakshmi Research Scholar, Department of Computer Science, Alagappa University, Karaikudi. annalakshmi_mu@yahoo.co.in Dr. A.
More informationIMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM
IMPLEMENTATION OF ACO ALGORITHM FOR EDGE DETECTION AND SORTING SALESMAN PROBLEM Er. Priya Darshni Assiociate Prof. ECE Deptt. Ludhiana Chandigarh highway Ludhiana College Of Engg. And Technology Katani
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 informationInternational Journal of Computer Engineering and Applications, Volume XII, Special Issue, August 18, ISSN
International Journal Computer Engineering and Applications, INTELLIGENT ROUTING BASED ON ACO TECHNIQUE F FAULT RING IN 2D-MESHES Gaytri Kumari Gupta research sclar, Jharkhand Rai University, Ranchi-India
More informationCHAPTER 5 SEARCH ENGINE USING SEMANTIC CONCEPTS
82 CHAPTER 5 SEARCH ENGINE USING SEMANTIC CONCEPTS In recent years, everybody is in thirst of getting information from the internet. Search engines are used to fulfill the need of them. Even though the
More informationChapter 6: Information Retrieval and Web Search. An introduction
Chapter 6: Information Retrieval and Web Search An introduction Introduction n Text mining refers to data mining using text documents as data. n Most text mining tasks use Information Retrieval (IR) methods
More informationWeb Information Retrieval using WordNet
Web Information Retrieval using WordNet Jyotsna Gharat Asst. Professor, Xavier Institute of Engineering, Mumbai, India Jayant Gadge Asst. Professor, Thadomal Shahani Engineering College Mumbai, India ABSTRACT
More informationCANDIDATE LINK GENERATION USING SEMANTIC PHEROMONE SWARM
CANDIDATE LINK GENERATION USING SEMANTIC PHEROMONE SWARM Ms.Susan Geethu.D.K 1, Ms. R.Subha 2, Dr.S.Palaniswami 3 1, 2 Assistant Professor 1,2 Department of Computer Science and Engineering, Sri Krishna
More informationAutomatic Programming with Ant Colony Optimization
Automatic Programming with Ant Colony Optimization Jennifer Green University of Kent jg9@kent.ac.uk Jacqueline L. Whalley University of Kent J.L.Whalley@kent.ac.uk Colin G. Johnson University of Kent C.G.Johnson@kent.ac.uk
More informationString Vector based KNN for Text Categorization
458 String Vector based KNN for Text Categorization Taeho Jo Department of Computer and Information Communication Engineering Hongik University Sejong, South Korea tjo018@hongik.ac.kr Abstract This research
More informationEncoding Words into String Vectors for Word Categorization
Int'l Conf. Artificial Intelligence ICAI'16 271 Encoding Words into String Vectors for Word Categorization Taeho Jo Department of Computer and Information Communication Engineering, Hongik University,
More informationAnt Algorithms. Simulated Ant Colonies for Optimization Problems. Daniel Bauer July 6, 2006
Simulated Ant Colonies for Optimization Problems July 6, 2006 Topics 1 Real Ant Colonies Behaviour of Real Ants Pheromones 2 3 Behaviour of Real Ants Pheromones Introduction Observation: Ants living in
More informationSolving a combinatorial problem using a local optimization in ant based system
Solving a combinatorial problem using a local optimization in ant based system C-M.Pintea and D.Dumitrescu Babeş-Bolyai University of Cluj-Napoca, Department of Computer-Science Kogalniceanu 1, 400084
More informationA hybrid method to categorize HTML documents
Data Mining VI 331 A hybrid method to categorize HTML documents M. Khordad, M. Shamsfard & F. Kazemeyni Electrical & Computer Engineering Department, Shahid Beheshti University, Iran Abstract In this paper
More informationCS 6320 Natural Language Processing
CS 6320 Natural Language Processing Information Retrieval Yang Liu Slides modified from Ray Mooney s (http://www.cs.utexas.edu/users/mooney/ir-course/slides/) 1 Introduction of IR System components, basic
More informationA Review: Optimization of Energy in Wireless Sensor Networks
A Review: Optimization of Energy in Wireless Sensor Networks Anjali 1, Navpreet Kaur 2 1 Department of Electronics & Communication, M.Tech Scholar, Lovely Professional University, Punjab, India 2Department
More informationAn Ant Approach to the Flow Shop Problem
An Ant Approach to the Flow Shop Problem Thomas Stützle TU Darmstadt, Computer Science Department Alexanderstr. 10, 64283 Darmstadt Phone: +49-6151-166651, Fax +49-6151-165326 email: stuetzle@informatik.tu-darmstadt.de
More informationWeighted Suffix Tree Document Model for Web Documents Clustering
ISBN 978-952-5726-09-1 (Print) Proceedings of the Second International Symposium on Networking and Network Security (ISNNS 10) Jinggangshan, P. R. China, 2-4, April. 2010, pp. 165-169 Weighted Suffix Tree
More informationA new improved ant colony algorithm with levy mutation 1
Acta Technica 62, No. 3B/2017, 27 34 c 2017 Institute of Thermomechanics CAS, v.v.i. A new improved ant colony algorithm with levy mutation 1 Zhang Zhixin 2, Hu Deji 2, Jiang Shuhao 2, 3, Gao Linhua 2,
More informationWordNet-based User Profiles for Semantic Personalization
PIA 2005 Workshop on New Technologies for Personalized Information Access WordNet-based User Profiles for Semantic Personalization Giovanni Semeraro, Marco Degemmis, Pasquale Lops, Ignazio Palmisano LACAM
More informationDynamic Robot Path Planning Using Improved Max-Min Ant Colony Optimization
Proceedings of the International Conference of Control, Dynamic Systems, and Robotics Ottawa, Ontario, Canada, May 15-16 2014 Paper No. 49 Dynamic Robot Path Planning Using Improved Max-Min Ant Colony
More informationA Survey Of Different Text Mining Techniques Varsha C. Pande 1 and Dr. A.S. Khandelwal 2
A Survey Of Different Text Mining Techniques Varsha C. Pande 1 and Dr. A.S. Khandelwal 2 1 Department of Electronics & Comp. Sc, RTMNU, Nagpur, India 2 Department of Computer Science, Hislop College, Nagpur,
More informationAnt Colony Based Load Flow Optimisation Using Matlab
Ant Colony Based Load Flow Optimisation Using Matlab 1 Kapil Upamanyu, 2 Keshav Bansal, 3 Miteshwar Singh Department of Electrical Engineering Delhi Technological University, Shahbad Daulatpur, Main Bawana
More informationMemory-Based Immigrants for Ant Colony Optimization in Changing Environments
Memory-Based Immigrants for Ant Colony Optimization in Changing Environments Michalis Mavrovouniotis 1 and Shengxiang Yang 2 1 Department of Computer Science, University of Leicester University Road, Leicester
More informationHybrid Ant Colony Optimization and Cuckoo Search Algorithm for Travelling Salesman Problem
International Journal of Scientific and Research Publications, Volume 5, Issue 6, June 2015 1 Hybrid Ant Colony Optimization and Cucoo Search Algorithm for Travelling Salesman Problem Sandeep Kumar *,
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 informationMaking Sense Out of the Web
Making Sense Out of the Web Rada Mihalcea University of North Texas Department of Computer Science rada@cs.unt.edu Abstract. In the past few years, we have witnessed a tremendous growth of the World Wide
More informationApplying Opposition-Based Ideas to the Ant Colony System
Applying Opposition-Based Ideas to the Ant Colony System Alice R. Malisia, Hamid R. Tizhoosh Department of Systems Design Engineering, University of Waterloo, ON, Canada armalisi@uwaterloo.ca, tizhoosh@uwaterloo.ca
More informationTERM BASED SIMILARITY MEASURE FOR TEXT CLASSIFICATION AND CLUSTERING USING FUZZY C-MEANS ALGORITHM
TERM BASED SIMILARITY MEASURE FOR TEXT CLASSIFICATION AND CLUSTERING USING FUZZY C-MEANS ALGORITHM D. Renukadevi, S. Sumathi Abstract The progress of information technology and increasing usability of
More informationWhat is this Song About?: Identification of Keywords in Bollywood Lyrics
What is this Song About?: Identification of Keywords in Bollywood Lyrics by Drushti Apoorva G, Kritik Mathur, Priyansh Agrawal, Radhika Mamidi in 19th International Conference on Computational Linguistics
More informationWorkflow Scheduling Using Heuristics Based Ant Colony Optimization
Workflow Scheduling Using Heuristics Based Ant Colony Optimization 1 J.Elayaraja, 2 S.Dhanasekar 1 PG Scholar, Department of CSE, Info Institute of Engineering, Coimbatore, India 2 Assistant Professor,
More informationResPubliQA 2010
SZTAKI @ ResPubliQA 2010 David Mark Nemeskey Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary (SZTAKI) Abstract. This paper summarizes the results of our first
More informationImproving Suffix Tree Clustering Algorithm for Web Documents
International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2015) Improving Suffix Tree Clustering Algorithm for Web Documents Yan Zhuang Computer Center East China Normal
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 informationACO for Maximal Constraint Satisfaction Problems
MIC 2001-4th Metaheuristics International Conference 187 ACO for Maximal Constraint Satisfaction Problems Andrea Roli Christian Blum Marco Dorigo DEIS - Università di Bologna Viale Risorgimento, 2 - Bologna
More informationInformation Retrieval and Web Search
Information Retrieval and Web Search Relevance Feedback. Query Expansion Instructor: Rada Mihalcea Intelligent Information Retrieval 1. Relevance feedback - Direct feedback - Pseudo feedback 2. Query expansion
More informationTEXT PREPROCESSING FOR TEXT MINING USING SIDE INFORMATION
TEXT PREPROCESSING FOR TEXT MINING USING SIDE INFORMATION Ms. Nikita P.Katariya 1, Prof. M. S. Chaudhari 2 1 Dept. of Computer Science & Engg, P.B.C.E., Nagpur, India, nikitakatariya@yahoo.com 2 Dept.
More informationNetwork routing problem-a simulation environment using Intelligent technique
Network routing problem-a simulation environment using Intelligent technique Vayalaxmi 1, Chandrashekara S.Adiga 2, H.G.Joshi 3, Harish S.V 4 Abstract Ever since the internet became a necessity in today
More informationHYBRID APROACH FOR WEB PAGE CLASSIFICATION BASED ON FIREFLY AND ANT COLONY OPTIMIZATION
HYBRID APROACH FOR WEB PAGE CLASSIFICATION BASED ON FIREFLY AND ANT COLONY OPTIMIZATION ABSTRACT: Poonam Asawara, Dr Amit Shrivastava and Dr Manish Manoria Department of Computer Science and Engineering
More informationCHAPTER 3 ASSOCIATON RULE BASED CLUSTERING
41 CHAPTER 3 ASSOCIATON RULE BASED CLUSTERING 3.1 INTRODUCTION This chapter describes the clustering process based on association rule mining. As discussed in the introduction, clustering algorithms have
More informationDocument Clustering: Comparison of Similarity Measures
Document Clustering: Comparison of Similarity Measures Shouvik Sachdeva Bhupendra Kastore Indian Institute of Technology, Kanpur CS365 Project, 2014 Outline 1 Introduction The Problem and the Motivation
More informationEnabling Semantic Search in Large Open Source Communities
Enabling Semantic Search in Large Open Source Communities Gregor Leban, Lorand Dali, Inna Novalija Jožef Stefan Institute, Jamova cesta 39, 1000 Ljubljana {gregor.leban, lorand.dali, inna.koval}@ijs.si
More informationOntology Based Search Engine
Ontology Based Search Engine K.Suriya Prakash / P.Saravana kumar Lecturer / HOD / Assistant Professor Hindustan Institute of Engineering Technology Polytechnic College, Padappai, Chennai, TamilNadu, India
More informationA Hybrid Unsupervised Web Data Extraction using Trinity and NLP
IJIRST International Journal for Innovative Research in Science & Technology Volume 2 Issue 02 July 2015 ISSN (online): 2349-6010 A Hybrid Unsupervised Web Data Extraction using Trinity and NLP Anju R
More informationAn Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem
1 An Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem Krishna H. Hingrajiya, Ravindra Kumar Gupta, Gajendra Singh Chandel University of Rajiv Gandhi Proudyogiki Vishwavidyalaya,
More informationAn Adaptive Agent for Web Exploration Based on Concept Hierarchies
An Adaptive Agent for Web Exploration Based on Concept Hierarchies Scott Parent, Bamshad Mobasher, Steve Lytinen School of Computer Science, Telecommunication and Information Systems DePaul University
More informationTowards the Automatic Creation of a Wordnet from a Term-based Lexical Network
Towards the Automatic Creation of a Wordnet from a Term-based Lexical Network Hugo Gonçalo Oliveira, Paulo Gomes (hroliv,pgomes)@dei.uc.pt Cognitive & Media Systems Group CISUC, University of Coimbra Uppsala,
More informationSYSTEMS FOR NON STRUCTURED INFORMATION MANAGEMENT
SYSTEMS FOR NON STRUCTURED INFORMATION MANAGEMENT Prof. Dipartimento di Elettronica e Informazione Politecnico di Milano INFORMATION SEARCH AND RETRIEVAL Inf. retrieval 1 PRESENTATION SCHEMA GOALS AND
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 Ant System with Direct Communication for the Capacitated Vehicle Routing Problem
An Ant System with Direct Communication for the Capacitated Vehicle Routing Problem Michalis Mavrovouniotis and Shengxiang Yang Abstract Ant colony optimization (ACO) algorithms are population-based algorithms
More informationAnt Colony Optimization Algorithm for Reactive Production Scheduling Problem in the Job Shop System
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Ant Colony Optimization Algorithm for Reactive Production Scheduling Problem in
More informationAnt-Colony Optimization for the System Reliability Problem with Quantity Discounts
American Journal of Operations Research, 2017, 7, 99-112 http://www.scirp.org/ournal/aor ISSN Online: 2160-8849 ISSN Print: 2160-8830 Ant-Colony Optimization for the System Reliability Problem with Quantity
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 informationSWARM INTELLIGENCE -I
SWARM INTELLIGENCE -I Swarm Intelligence Any attempt to design algorithms or distributed problem solving devices inspired by the collective behaviourof social insect colonies and other animal societies
More informationParallel Implementation of Travelling Salesman Problem using Ant Colony Optimization
Parallel Implementation of Travelling Salesman Problem using Ant Colony Optimization Gaurav Bhardwaj Department of Computer Science and Engineering Maulana Azad National Institute of Technology Bhopal,
More informationMIRROR SITE ORGANIZATION ON PACKET SWITCHED NETWORKS USING A SOCIAL INSECT METAPHOR
MIRROR SITE ORGANIZATION ON PACKET SWITCHED NETWORKS USING A SOCIAL INSECT METAPHOR P. Shi, A. N. Zincir-Heywood and M. I. Heywood Faculty of Computer Science, Dalhousie University, Halifax NS, Canada
More informationResults of NBJLM for OAEI 2010
Results of NBJLM for OAEI 2010 Song Wang 1,2, Gang Wang 1 and Xiaoguang Liu 1 1 College of Information Technical Science, Nankai University Nankai-Baidu Joint Lab, Weijin Road 94, Tianjin, China 2 Military
More informationImprovement of a car racing controller by means of Ant Colony Optimization algorithms
Improvement of a car racing controller by means of Ant Colony Optimization algorithms Luis delaossa, José A. Gámez and Verónica López Abstract The performance of a car racing controller depends on many
More informationAnt Colony Optimization
Ant Colony Optimization CompSci 760 Patricia J Riddle 1 Natural Inspiration The name Ant Colony Optimization was chosen to reflect its original inspiration: the foraging behavior of some ant species. It
More informationANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)
ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET) DWEEPNA GARG 1 & PARTH GOHIL 2 1,2 Dept. Of Computer Science and Engineering, Babaria Institute of Technology, Varnama, Vadodara, India E-mail
More informationWordnet Based Document Clustering
Wordnet Based Document Clustering Madhavi Katamaneni 1, Ashok Cheerala 2 1 Assistant Professor VR Siddhartha Engineering College, Kanuru, Vijayawada, A.P., India 2 M.Tech, VR Siddhartha Engineering College,
More informationAccelerating Ant Colony Optimization for the Vertex Coloring Problem on the GPU
Accelerating Ant Colony Optimization for the Vertex Coloring Problem on the GPU Ryouhei Murooka, Yasuaki Ito, and Koji Nakano Department of Information Engineering, Hiroshima University Kagamiyama 1-4-1,
More informationNORMALIZATION OF ACO ALGORITHM PARAMETERS
U.P.B. Sci. Bull., Series C, Vol. 79, Iss. 2, 2017 ISSN 2286-3540 NORMALIZATION OF ACO ALGORITHM PARAMETERS Alina E. NEGULESCU 1 Due to the fact that Swarm Systems algorithms have been determined to be
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 informationOn-Line Scheduling Algorithm for Real-Time Multiprocessor Systems with ACO and EDF
On-Line Scheduling Algorithm for Real-Time Multiprocessor Systems with ACO and EDF Cheng Zhao, Myungryun Yoo, Takanori Yokoyama Department of computer science, Tokyo City University 1-28-1 Tamazutsumi,
More informationQuestion Answering Approach Using a WordNet-based Answer Type Taxonomy
Question Answering Approach Using a WordNet-based Answer Type Taxonomy Seung-Hoon Na, In-Su Kang, Sang-Yool Lee, Jong-Hyeok Lee Department of Computer Science and Engineering, Electrical and Computer Engineering
More informationCADIAL Search Engine at INEX
CADIAL Search Engine at INEX Jure Mijić 1, Marie-Francine Moens 2, and Bojana Dalbelo Bašić 1 1 Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia {jure.mijic,bojana.dalbelo}@fer.hr
More informationEvaluating a Conceptual Indexing Method by Utilizing WordNet
Evaluating a Conceptual Indexing Method by Utilizing WordNet Mustapha Baziz, Mohand Boughanem, Nathalie Aussenac-Gilles IRIT/SIG Campus Univ. Toulouse III 118 Route de Narbonne F-31062 Toulouse Cedex 4
More informationCluster-based Similarity Aggregation for Ontology Matching
Cluster-based Similarity Aggregation for Ontology Matching Quang-Vinh Tran 1, Ryutaro Ichise 2, and Bao-Quoc Ho 1 1 Faculty of Information Technology, Ho Chi Minh University of Science, Vietnam {tqvinh,hbquoc}@fit.hcmus.edu.vn
More informationChapter 27 Introduction to Information Retrieval and Web Search
Chapter 27 Introduction to Information Retrieval and Web Search Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 27 Outline Information Retrieval (IR) Concepts Retrieval
More informationInternational Journal of Current Trends in Engineering & Technology Volume: 02, Issue: 01 (JAN-FAB 2016)
Survey on Ant Colony Optimization Shweta Teckchandani, Prof. Kailash Patidar, Prof. Gajendra Singh Sri Satya Sai Institute of Science & Technology, Sehore Madhya Pradesh, India Abstract Although ant is
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 informationJune 15, Abstract. 2. Methodology and Considerations. 1. Introduction
Organizing Internet Bookmarks using Latent Semantic Analysis and Intelligent Icons Note: This file is a homework produced by two students for UCR CS235, Spring 06. In order to fully appreacate it, it may
More informationAnnotated Suffix Trees for Text Clustering
Annotated Suffix Trees for Text Clustering Ekaterina Chernyak and Dmitry Ilvovsky National Research University Higher School of Economics Moscow, Russia echernyak,dilvovsky@hse.ru Abstract. In this paper
More informationTasks Scheduling using Ant Colony Optimization
Journal of Computer Science 8 (8): 1314-1320, 2012 ISSN 1549-3636 2012 Science Publications Tasks Scheduling using Ant Colony Optimization 1 Umarani Srikanth G., 2 V. Uma Maheswari, 3.P. Shanthi and 4
More informationA genetic algorithm based focused Web crawler for automatic webpage classification
A genetic algorithm based focused Web crawler for automatic webpage classification Nancy Goyal, Rajesh Bhatia, Manish Kumar Computer Science and Engineering, PEC University of Technology, Chandigarh, India
More informationAn Efficient Approach for Requirement Traceability Integrated With Software Repository
An Efficient Approach for Requirement Traceability Integrated With Software Repository P.M.G.Jegathambal, N.Balaji P.G Student, Tagore Engineering College, Chennai, India 1 Asst. Professor, Tagore Engineering
More informationRobust Descriptive Statistics Based PSO Algorithm for Image Segmentation
Robust Descriptive Statistics Based PSO Algorithm for Image Segmentation Ripandeep Kaur 1, Manpreet Kaur 2 1, 2 Punjab Technical University, Chandigarh Engineering College, Landran, Punjab, India Abstract:
More informationCHAOTIC ANT SYSTEM OPTIMIZATION FOR PATH PLANNING OF THE MOBILE ROBOTS
CHAOTIC ANT SYSTEM OPTIMIZATION FOR PATH PLANNING OF THE MOBILE ROBOTS Xu Mingle and You Xiaoming Shanghai University of Engineering Science, Shanghai, China ABSTRACT This paper presents an improved ant
More informationLetter Pair Similarity Classification and URL Ranking Based on Feedback Approach
Letter Pair Similarity Classification and URL Ranking Based on Feedback Approach P.T.Shijili 1 P.G Student, Department of CSE, Dr.Nallini Institute of Engineering & Technology, Dharapuram, Tamilnadu, India
More informationSolving the Shortest Path Problem in Vehicle Navigation System by Ant Colony Algorithm
Proceedings of the 7th WSEAS Int. Conf. on Signal Processing, Computational Geometry & Artificial Vision, Athens, Greece, August 24-26, 2007 88 Solving the Shortest Path Problem in Vehicle Navigation System
More informationCombined A*-Ants Algorithm: A New Multi-Parameter Vehicle Navigation Scheme
Combined A*-Ants Algorim: A New Multi-Parameter Vehicle Navigation Scheme Hojjat Salehinejad, Hossein Nezamabadi-pour, Saeid Saryazdi and Fereydoun Farrahi-Moghaddam Department of Electrical Engineering,
More informationSemantic Search in s
Semantic Search in Emails Navneet Kapur, Mustafa Safdari, Rahul Sharma December 10, 2010 Abstract Web search technology is abound with techniques to tap into the semantics of information. For email search,
More informationResearch Article A Novel Steganalytic Algorithm based on III Level DWT with Energy as Feature
Research Journal of Applied Sciences, Engineering and Technology 7(19): 4100-4105, 2014 DOI:10.19026/rjaset.7.773 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitted:
More informationConcept-Based Document Similarity Based on Suffix Tree Document
Concept-Based Document Similarity Based on Suffix Tree Document *P.Perumal Sri Ramakrishna Engineering College Associate Professor Department of CSE, Coimbatore perumalsrec@gmail.com R. Nedunchezhian Sri
More informationSearching for Maximum Cliques with Ant Colony Optimization
Searching for Maximum Cliques with Ant Colony Optimization Serge Fenet and Christine Solnon LIRIS, Nautibus, University Lyon I 43 Bd du 11 novembre, 69622 Villeurbanne cedex, France {sfenet,csolnon}@bat710.univ-lyon1.fr
More informationCHAPTER 3 INFORMATION RETRIEVAL BASED ON QUERY EXPANSION AND LATENT SEMANTIC INDEXING
43 CHAPTER 3 INFORMATION RETRIEVAL BASED ON QUERY EXPANSION AND LATENT SEMANTIC INDEXING 3.1 INTRODUCTION This chapter emphasizes the Information Retrieval based on Query Expansion (QE) and Latent Semantic
More informationInformation Retrieval
Information Retrieval CSC 375, Fall 2016 An information retrieval system will tend not to be used whenever it is more painful and troublesome for a customer to have information than for him not to have
More informationBlind Image Deconvolution Technique for Image Restoration using Ant Colony Optimization
Blind Image Deconvolution Technique for Image Restoration using Ant Colony Optimization Amandeep Kaur CEM Kapurthala, Punjab Vinay Chopra DAVIET Jalandhar Punjab ABSTRACT Image Restoration is a field of
More informationHebei University of Technology A Text-Mining-based Patent Analysis in Product Innovative Process
A Text-Mining-based Patent Analysis in Product Innovative Process Liang Yanhong, Tan Runhua Abstract Hebei University of Technology Patent documents contain important technical knowledge and research results.
More informationClustering Technique with Potter stemmer and Hypergraph Algorithms for Multi-featured Query Processing
Vol.2, Issue.3, May-June 2012 pp-960-965 ISSN: 2249-6645 Clustering Technique with Potter stemmer and Hypergraph Algorithms for Multi-featured Query Processing Abstract In navigational system, it is important
More information