WEB SEARCH USING DYNAMIC KEYWORD SUGGESTION

Y. Park and B.S. Kim

References

  1. [1] Search engine tutorials, Search engine Watch, available at http://searchenginewatch.com/.
  2. [2] How search engines work, Search Engine Showdown, available at http://searchenginewatch.com/webmasters/article.php/ 2168031.
  3. [3] The users’ guide to Web searching, available at http://www. searchengineshowdown.com/.
  4. [4] Finding information on the Internet: A tutorial, available at http://www.lib.berkeley.edu/TeachingLib/Guides/Internet/ FindInfo.html.
  5. [5] S. Brin & L. Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, 30, 1998, 107–117. doi:10.1016/S0169-7552(98)00110-X
  6. [6] B. Ganter & R. Wille, Formal concept analysis: Mathematical foundations (Heidelberg: Springer-Verlag, 1999).
  7. [7] A formal concept analysis homepage, available at http://www. upriss.org.uk/fca/fca.html.
  8. [8] B. Ganter, G. Stumme, & R. Wille (Eds.), Formal concept analysis: Foundations and applications, Lecture Notes in Computer Science 3626 (Heidelberg-Berlin: Springer, 2005). 8
  9. [9] Y. Park, Software retrieval by samples using concept analysis, Journal of Systems and Software, 54(3), 2000, 179–183. doi:10.1016/S0164-1212(00)00036-4
  10. [10] M. Siff & T. Reps, Identifying modules via concept analysis, Int. Conf. on Software Maintenance, Bari, Italy, 1997, 170–179. doi:10.1109/ICSM.1997.624243
  11. [11] T. Tilley, R. Cole, P. Becker, & P. Eklund, A survey of formal concept analysis support for software engineering activities, Int. Conf. on Formal Concept Analysis, Darmstadt, Germany, 2003, 250–271.
  12. [12] S.O. Kuznetsov & S.A. Obedkov, Comparing performance of algorithms for generating concept lattices, Journal of Experimental and Theoretical Artificial Intelligence, 14(23), 2002, 189–216. doi:10.1080/09528130210164170
  13. [13] C. Lindig, Fast concept analysis, Working with conceptual structures: Contributions to ICCS, Darmstadt, Germany, 2000, 152–161.

Important Links:

Go Back