Advertisement

Introducing lateral thinking in search engines

  • Yann Landrin-Schweitzer
  • Pierre Collet
  • Evelyne LuttonEmail author
Article

Abstract

Decomposing a very complex problem into smaller subproblems that are much easier to solve is not a new idea. The “Parisian Approach”[9] applies this principle extensively to shatter complexity by cutting down the original problem into many small subproblems that are then globally optimized thanks to an evolutionary algorithm. This paper describes how this approach has been used to interactively evolve a user profile to be used by a search engine. User queries are rewritten thanks to the evolved profile, resulting in an increased diversity in the retrieved documents that is showing an interesting property: even though precision is lost, retrieved documents relate both to the user’s query and to his areas of interest in a manner that evokes “lateral thinking”. This paper describes ELISE, an Evolutionary Learning Interactive Search Engine that interactively evolves rewriting modules and rules (some kind of elaborated user profile) along a Parisian Approach. Results obtained over a public domain benchmark (Cystic Fibrosis Database) are presented and discussed.

Keywords

Operating System Artificial Intelligence Cystic Fibrosis Search Engine Evolutionary Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    W. Banzhaf, “Interactive evolution,” Section C2.10, in Handbook of Evolutionary Computation, Oxford University Press, 1997.Google Scholar
  2. 2.
    A. Boumaza and J. Louchet, “Dynamic flies: Using real-time parisian evolution in robotics,” in EVOIASP 2001, E. J. W. Boers, S. Cagnoni, J. Gottlieb, E. Hart, P. L. Lanzi, G. R. Raidl, R. E. Smith and H Tijink (eds.), Springer, Lake Como, Italy, LNCS 2037, 2001, pp. 288–297Google Scholar
  3. 3.
    R. J. Brachman, “What’s in a concept: Structural foundations for semantic networks,” International Journal of Man-Machine Studies, vol. 9, pp. 127–152, 1977Google Scholar
  4. 4.
    C. Brouard, “Building and using fuzzy semantic networks for extraction of relevant information: The RELIEFS system,” PhD. Thesis, LIP6, University Paris-6, 2000.Google Scholar
  5. 5.
    E. Cantu-Paz and C. Kamath, “On the use of evolutionary algorithms in data mining,” in Data Mining: A Heuristic Approach, H. Abbass, R. Sarker and C. Newton (eds.), Hershey, PA: IDEA Group Publishing, 2002, pp. 48–71.Google Scholar
  6. 6.
    J. Chapuis and E. Lutton “ArtiE-Fract: Interactive evolution of fractals”, in GA ’01, Generative Art Conference, C. Soddu (ed.), Published by Generative Design Lab DIAP, Politecnico di Milano, http://www.generativeart.com/, Milano, Italy, 2001.
  7. 7.
    H. Chen, “Machine learning for information retrieval: neural networks, symbolic learning and genetic algorithms,” Journal of the American Society for Information Science and Technology, vol. 46, pp. 194–216, 1995.Google Scholar
  8. 8.
    H. Chen, G. Shankaranarayanan, L. She and A. Iyer, “A machine learning approach to inductive query by examples: An experiment using relevance feedback, ID3, genetic algorithms and simulated annealing,” Journal of the American Society for Information Science and Technology, vol. 49, pp. 639–705, 1998.Google Scholar
  9. 9.
    P. Collet, E. Lutton, F. Raynal and M. Schoenauer, “Polar IFS + parisian genetic programming = efficient IFS inverse problem solving,” Genetic Programming and Evolvable Machines Journal, vol. 1, pp. 339–361, 2000.Google Scholar
  10. 10.
    Cystic Fibrosis Reference Collection, http://www.sims.berkeley.edu/hearst/irbook/cfc.html
  11. 11.
    L. Davis “Adapting operator probabilities in Genetic Algorithms,” in ICGA ’89, International Conference on Genetic Algorithms and their Application, K. De Jong (ed.), George Mason University, Fairfax, Virginia, USA, Morgan Kaufmann Publishers, 1989, pp. 61–69.Google Scholar
  12. 12.
    S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer and R. Harshman “Indexing by latent semantic analysis,” Journal of the American Society for Information Science, vol. 41, pp. 391–407, 1990.Google Scholar
  13. 13.
    A. Dix, “Interactive Querying, locating and dicovering information,” in Second Workshop on Information Retrieval and Human Computer Interaction, Published by the British Computer Society, M. Dunlop and C. Johnson (eds.), http://www.dcs.gla.ac.uk/irhci/, Glasgow, 11th September 1998.
  14. 14.
    EMBASE, the Excerpta Medica database, Elsevier Science, Secondary Publishing Division, New YorkGoogle Scholar
  15. 15.
    C. Fellbaum and G. A. Miller, “WordNet: An electronic lexical database,” in Language, speech and communication, George A. Miller (ed.), chapter 3. The MIT Press, Cambridge, 1998, pp. 69–104.Google Scholar
  16. 16.
    D. J. Foskett. “Thesaurus,” in Readings in Information Retrieval, Morgan Kaufmann Multimedia Information and Systems Series, K. S. Jones and P. Willet (eds.), M. Kaufmann Publishers, San Fransisco, 1997, pp. 111–134.Google Scholar
  17. 17.
    A. A. Freitas, “Data mining with evolutionary algorithms: research directions,” in AAAI Workshop, Technical Report WS-99-06, ISBN 1-57735-090-1, The AAAI Press, 1999, p. 34.Google Scholar
  18. 18.
    A. A. Freitas, “A survey of evolutionary algorithms for data mining and knowledge discovery,” in Advances in Evolutionary Computation, A. Ghosh and S. Tsutsui (eds.), Springer-Verlag, 2002, pp. 819–845.Google Scholar
  19. 19.
    D. A. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishing, Reading, Massachusetts, 1989.Google Scholar
  20. 20.
    M. D. Gordon, “Probabilistic and genetic algrithms for document retrieval,” in Communications of the ACM, vol. 31, pp. 1208–1218, 1988.Google Scholar
  21. 21.
    T. Hofmann, “Probabilistic latent semantic indexing,” in International ACM SIGIR Conference on Research and Development in Information Retrieval, M. Hearst, F. Gey and R. Tong, (eds.), New York: ACM Press, 1999, pp. 50–57.Google Scholar
  22. 22.
    J.-T. Horng and C.-C. Yeh, “Applying genetic algorithms to query optimisation in document retrieval,” Information Processing and Management, vol. 36, pp. 737–759, 2000.Google Scholar
  23. 23.
    S. Kamohara, H. Takagi and T. Takeda, “Control rule acquisition for an arm wrestling robot,” in IEEE Int. Conf. on System, Man and Cybernetics (SMC’97), Orlando, FL, USA, 1997, vol. 5, pp. 4227–4231.Google Scholar
  24. 24.
    Y.-H. Kim, S. Kim, J.-H. Eom and B.-T. Zhang, “SCAI Experiments on TREC-9, ” in Proceedings of theNinth Text Retrieval Conference (TREC-9), E. Voorhees and D. Harman (eds.), 2000, pp. 392–399, Gaithersburg, Maryland, NIST Special Publication.Google Scholar
  25. 25.
    S. Kim and B.-T. Zhang, “Evolutionary learning of web-document structure for information retrieval,” in Proceedings of the2001 Congress on Evolutionary Computation (CEC2001), 2001, vol. 2, pp. 1253–1260.Google Scholar
  26. 26.
    R. McNaughton, “Algebraic decision procedures for local testability,” Math. Systems Theory, vol. 8, pp. 60–76, 1974.Google Scholar
  27. 27.
    R. McNaughton, “Testing and generating infinite sequences by a finite automaton,” Information and Control, vol. 9, 1966, pp. 521–530.Google Scholar
  28. 28.
    R. McNaughton and S. Papert, ”Counter-free automata,” in With an Appendix by W. Henneman (ed.), M.I.T. Research Monograph, The M.I.T. Press, Mass.-London, Cambridge, vol. 65, 1971.Google Scholar
  29. 29.
    “MeSH (Medical Subject Headings), a controlled vocabulary thesaurus” http://www.nlm.nih.gov/pubs/factsheets/mesh.html, National Library of Medicine (NLM), National Institutes of Health, Bethesda, Maryland
  30. 30.
    C. Meyer, J.-G. Ganascia and J.-D. Zucker, “Learning strategies in games by anticipation,” in IJCAI ’97, International Joint Conference on Artificial Intelligence, M. Georgeff (ed.), Morgan Kaufman, Nagoya, Japan, 1997, pp. 698–707.Google Scholar
  31. 31.
    G. A. Miller, C. Fellbaum, R. Tengi and P. Wakefield, “WordNet, an electronic lexical database for the english language: http://www.cogsci.princeton.edu/wn/” Cognitive Science Laboratory, Princeton University.
  32. 32.
    N. Monmarche, G. Nocent, G. Venturini and P. Santini. “On Generating HTML style sheets with an interactive genetic algorithm based on gene frequencies,” in Artificial Evolution, European Conference, AE 99, C. Fonlupt and J. K. Hao and E. Lutton and E. Ronald and M. Schoenauer (eds.), Dunkerque, France, November 1999, Selected papers, Springer Verlag, LNCS 1829, 1999, pp. 99–110.Google Scholar
  33. 33.
    Y. Landrin-Schweitzer, XCLE, Extensible Concatenative Language Engine, http://www.varkhan.net/software/xcl/XCLE
  34. 34.
    S. K. Pal, V. Talwar and P. Mitra, “Web mining in soft computing framework: Relevance, state of the art and future directions,” in IEEE Transactions on Neural Networks, vol. 13, pp. 3–14, 2001.Google Scholar
  35. 35.
    R. S. Parpinelli, H. S. Lopes and A. A. Freitas, “Data mining with an ant colony optimization algorithm,” in IEEE Trans. on Evolutionary Computation, Special Issue on ant Colony Algorithms, vol. 6, pp. 321–332, 2002.Google Scholar
  36. 36.
    R. Poli and S. Cagnoni, “Genetic programming with user-driven selection: Experiments on the of algorithms for image enhancement,” in 2nd Annual Conf. on Genetic Programming, John R., Koza, Deb, Kalyanmoy, Dorigo, Marco, Fogel, B. David, Garzon, Max, Iba, Hitoshi, and Rick L. Riolo, (eds.), Morgan Kaufmann, Stanford, 1997, pp. 269–277.Google Scholar
  37. 37.
    J. D. Schaffer and A Morishima “An adaptive crossover distribution mechanism for genetic algorithms,” in ICGA ’87, International Conference on Genetic Algorithms, New Jersey, JJ Grefenstette, L. Erlbaum Associate, pp. 36–40, 1987.Google Scholar
  38. 38.
    M. Sebag, C. Ravise and M. Schoenauer “Controlling evolution by means of machine learning,” EP 1996, in 5th Annual Conf. on Evolutionary Programming (EP’96), P.J. Angeline and T. Bäck (eds.), L.J. Fogel, MIT Press, San Diego, USA, pp. 57–66, 1996.Google Scholar
  39. 39.
    D.-H. Shin, Y.-H. Kim, S. Kim, J.-H. Eom, H.-J. Shin and B.-T. Zhang, “SCAI TREC-8 experiments”, in Proceedings of theEighth Text Retrieval Conference (TREC-8), pp. 511–518, 1999.Google Scholar
  40. 40.
    K. Sims, “Interactive evolution of dynamical systems,” in First European Conference on Artificial Life, F. Varela and P. Bourgine (eds.), MIT Press, Paris, pp 171–178, 1991.Google Scholar
  41. 41.
    K. Sims, “Artificial Evolution for Computer Graphics,” Computer Graphics, vol. 25, 319–328, 1991.Google Scholar
  42. 42.
    W. M. Spears “Adapting crossover in a genetic algortithm,” in Proceedings of the Evolutionary Programming Conference, J. R. McDonnell, R. G. Reynolds and D. B. Fogel (eds.), The MIT Press, Cambridge, MA, 1995, pp. 367–384.Google Scholar
  43. 43.
    SWISH++, Simple Web Indexing System for Humans: C++ version, http://homepage.mac.com/pauljlucas/software/swish/
  44. 44.
    H. Takagi, “Interactive evolutionary computation: System optimisation based on human subjective evaluation,” in IEEE Int. Conf. on Intelligent Engineering Systems (INES’98), Vienna, Austria, pp. 1–6, 1998.Google Scholar
  45. 45.
    H. Takagi and M. Ohsaki, “IEC-based hearing aids fitting,” in IEEE Int. Conf. on System, Man and Cybernetics (SMC’99), Tokyo, Japan, 1999, vol. 3, pp. 657–662.Google Scholar
  46. 46.
    “The BEST Search Engines,” UC Berkeley — Teaching Library Internet Workshops http://www.lib.berkeley.edu/TeachingLib/Guides/Internet/SearchEngines.html
  47. 47.
    S.J.P. Todd and W. Latham, Evolutionary Art and Computers, Academic Press, 1992.Google Scholar
  48. 48.
    The Text REtrieval Conference (TREC) homepage http://trec.nist.gov/
  49. 49.
    L.Y. Tseng and S. B. Yang, “Genetic algrithms for clustering. Feature selection and classification,” in International Conference on Neural Networks, W. Gerstner, A. Germond, M. Hasler and J.-D. Nicoud (eds.), Lausanne, Switzerland, October 8–10, Lecture notes in computer science 1327 Springer, 1997, pp. 1612–1616.Google Scholar
  50. 50.
    T. Vachon, N. Grandjean and P. Parisot, “Interactive Exploration of Patent Data for Competitive Intelligence: Applications in Ulix (Novartis Knowledge Miner),” in International Chemical Information Conference and Exhibition, H. Collier (ed.), Published by Infonortics, ISBN 1-873699-38-7, Nimes, France, 2001, pp. 265–268.Google Scholar
  51. 51.
    M. J. Martin-Bautista, M.-A. Vila and H. L. Larsen, “A Fuzzy genetic algorithm approach to an adaptive information retrieval agent,” Journal of the American Society for Information Science and Technology, vol. 50, pp. 760–771, 1999.Google Scholar
  52. 52.
    D. Vrajitoru, “Large population or many generations for genetic algorithms? Implications in information retrieval,” in Soft Computing in Information Retrieval. Techniques and Applications, F. Crestani and G. Pasi (eds.), Heidelberg, Physica-Verlag, 2000, pp. 199–222.Google Scholar
  53. 53.
    W. Winiwarter, “PEA-A Personal E-mail assistant with evolutionary adaptation,” International Journal of Information Technology, vol. 5, pp. 480–492, 1999.Google Scholar
  54. 54.
    M. L. Wong, K. S. Leung and J. C.Y. Cheng, “Discovering knowledge from noisy databases using genetic programming,” Journal of the American Society for Information Science and Technology, vol. 51, 2000.Google Scholar
  55. 55.
    J. Yang, R. R. Korfhage and E. Rasmussen, “Query improvement in information retrieval using genetic algorithms: A on the experiments of the TREC project,” in The first Text Retrieval Conference (TREC-1), Gaithersburg, Maryland, NIST Special publ. 500–207, pp. 31–58, 1993.Google Scholar
  56. 56.
    J. Yang and V. Honavar, “Feature extraction, construction and selection—A data mining perspective,” Motoda, H. and Liu, H. (eds.), Kluver Academics Publishes, New York, Kluwer, 1998, pp. 117–136.Google Scholar
  57. 57.
    B.-T. Zhang, J.-H. Kwak and C.-H. Lee, “Building Software agents for information fitlering on the internet: A genetic programing approach,” in Late Breaking Papers at the Genetic Programming 1996 Conference (GP-96), Stanford University, p. 196, 1996.Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Yann Landrin-Schweitzer
    • 1
  • Pierre Collet
    • 2
  • Evelyne Lutton
    • 1
    Email author
  1. 1.COMPLEX Team—INRIA RocquencourtLe Chesnay CedexFrance
  2. 2.Laboratoire d’Informatique du Littoral, ULCOCalais CedexFrance

Personalised recommendations