# FINDING PATHS CONNECTING TWO PROPER NOUNS USING AN ANT COLONY ALGORITHM

### Dinesh Hakande

#### Abstract

Collaborative systems available on the Web allow millions of users to share information through a growing collection of tools and platforms such as wiki- patforms, blogs, and shared forums. With abundant information resources on the Internet such as Wikipedia or the Freebase, we study the connections between two proper nouns. Nevertheless, the problem is a challenging search problem, as information on the Internet is undoubtedly large and full of irrelevant information. In this project, we first parse and mine the entire Freebase database in order to extract the relevant information of proper nouns. Further we apply Ant Colony Optimization method for finding the path that connects two proper nouns together.

#### References

- Dorigo, M. (1992) "Optimization, Learning and Natural Algorithms", PhD Thesis, Dipartimento di Elettronica, Politechico di Milano, Italy.
- Dorigo, M. and Gambardella, L. (1997) "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem", IEEE Transactions on Evolutionary Computing, 1, pp. 53-66.
- A N Langville, C D Meyer and P FernÁndez. Google's pagerank and beyond: The science of Search engine rankings. The Mathematic Intelligencer, 30(1), 2008.
- E Friedman, P Resnick, and R Sami. Manipulationresistant Reputation systems. Algorithmic Game Theory, 2007
- H. Fan, Z. Hua, J. Li, D. Yuan, “Solving a shortest a path problem by ant algorithm”, Proceedings of the Third International Conference on Machine Learning and Cybernetics, Shanghai, 26-29 August 2004.
- C. Chu, J. Gu, X. Hou, Q. Gu, “A heuristic ant algorithm for solving QoS multicast routing problem”, IEEE 2002.
- M. Dorigo, G. Di Caro, and L.M. Gambardella,“Ant algorithm for discrete optimization”, Artificial Life, vol. 5, no. 2, pp. 137-172, 1999.

#### Paper Citation

#### in Harvard Style

Hakande D. (2011). **FINDING PATHS CONNECTING TWO PROPER NOUNS USING AN ANT COLONY ALGORITHM** . In *Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)* ISBN 978-989-8425-83-6, pages 346-351. DOI: 10.5220/0003694703460351

#### in Bibtex Style

@conference{ecta11,

author={Dinesh Hakande},

title={FINDING PATHS CONNECTING TWO PROPER NOUNS USING AN ANT COLONY ALGORITHM},

booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)},

year={2011},

pages={346-351},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0003694703460351},

isbn={978-989-8425-83-6},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)

TI - FINDING PATHS CONNECTING TWO PROPER NOUNS USING AN ANT COLONY ALGORITHM

SN - 978-989-8425-83-6

AU - Hakande D.

PY - 2011

SP - 346

EP - 351

DO - 10.5220/0003694703460351