Mining web functional dependencies for flexible information access

Journal of the American Society for Information Science and Technology

Volumn 58, Issue 12, 2007, Pages 1805-1819

  Perugini, Saverio ^a   Ramakrishnan, Naren ^b  

^a University of Dayton   (United States)

^b VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPLORABLE SEQUENCES; WEB STRUCTURE MINING;

HIERARCHICAL SYSTEMS; INTERFACES (COMPUTER); SET THEORY; WEBSITES;

DATA MINING;

EID: 35348903822     PISSN: 15322882     EISSN: 15322890     Source Type: Journal    
DOI: 10.1002/asi.20628     Document Type: Article

References (25)

1. Agrawal, R., Imielinski, T., & Swami, A. N. (1993, May). Mining association rules between sets of items in large databases. In P. Buneman & S. Jajodia (Eds.), Proceedings of the ACM International Conference on Management of Data (SIGMOD) (pp. 207-216). New York, NY: ACM Press.
2. Agrawal, R., & Srikant, R. (1994, September). Fast algorithms for mining association rules. In Proceedings of the International Conference on Very Large Databases (VLDB) (pp. 497-499). San Fransisco, CA: Morgan Kaufmann.
3. Bai, J., Song, D., Bruza, P.D., Nie, J.-Y., & Cao, G. (2005, October-November). Query expansion using term relationships in language models for information retrieval. In Proceedings of the Seventh International Conference on Information Knowledge Management (CIKM) (pp. 688-695). Bremen, New York, NY: ACM Press.
4. Bruza, P.D., & Dennis, S. (1997, June). Query reformulation on the Internet: Empirical data and the hyperindex search engine. In Proceedings of the RIAO Conference on Computer-Assisted Information Searching on Internet (pp. 488-499). New York, NY: ACM Press.
5. Carpineto, C., DeMori, R., Romano, G., & Bigi, B. (2001). An informationtheoretic approach to automatic query expansion. ACM Transactions on Information Systems, 19(1), 1-27.
6. Chen, M.-S., Park, J.S., & Yu, P.S. (1998). Efficient data mining for path traversal patterns. IEEE Transactions on Knowledge and Data Engineering, 10(2), 209-221.
7. Cui, H., Wen, J.-R., Nie, J.-Y., & Ma, W.-Y. (2002, May). Probabilistic query expansion using query logs. In Proceedings of the 11th International World Wide Web Conference (WWW11) (pp. 325-332). New York, NY: ACM Press.
8. Eirinaki, M., & Vazirgiannis, M. (2003). Web mining for Web personalization. ACM Transactions on Internet Technology, 3(1), 1-27.
9. Ganesan, P., García-Molina, H., & Widom, J. (2003). Exploiting hierarchical domain structure to computer similarity. ACM Transactions on Information Systems, 21(1), 63-93.
10. Garcia-Molina, H., Ullman, J.D., & Widom, J.D. (2002). Database systems: The complete book. Upper Saddle River, NJ: Prentice Hall.
11. Hearst, M.A., Elliott, A., English, J., Sinha, R., Swearingen, K., & Yee, K.-P. (2002). Finding the flow in Web site search. Communications of the ACM, 45(9), 42-49.
12. Huhtala, Y., Krkkinen, J., Porkka, P., & Toivonen, H. (1999). TANE: An Efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2), 100-111.
13. Kamdar, T., & Joshi, A. (2005). Using incremental Web log mining to create adaptive Web servers. International Journal on Digital Libraries, 5(2), 133-150.
14. Kolari, P., & Joshi, A. (2004). Web mining: research and practice. IEEE Computing in Science and Engineering, 6(4), 49-53.
15. Mano, H., & Ogawa, Y. (2001, September). Selecting expansion terms in automatic query expansion. In Proceedings of the 24th Annual International ACM Conference on Research and Development in Information Retrieval (SIGIR) (pp. 390-391). New York, NY: ACM Press.
16. Nambiar, U., & Kambhampati, S. (2004, June). Mining approximate functional dependencies and concept similarities to answer imprecise queries. In Proceedings of the Seventh International Workshop on the Web and Databases (WebDB) (pp. 73-78). New York, NY: ACM Press.
17. Narayan, M., Williams, C., Perugini, S., & Ramakrishnan, N. (2004, May). Staging transformations for multimodal Web interaction management. In Proceedings of the 13th International ACM World Wide Web Conference (WWW) (pp. 212-223). New York, NY: ACM Press.
18. Perugini, S. (2004). Program Transformations for Information Personalization. Ph.D. dissertation, Virginia Tech. Retrieved from http://scholar. lib.vt.edu/theses/available/etd-06252004-162449/(U.S. Copyright Office Registration Number TX 6-040-012).
19. Perugini, S., & Ramakrishnan, N. (2003). Personalizing Web sites with mixed-initiative interaction. IEEE IT Professional, 5(2), 9-15.
20. Perugini, S., & Ramakrishnan, N. (2006). Interacting with Web hierarchies. IEEE IT Professional, 8(4), 19-28.
21. Resnik, P. (1999). Semantic similarity in a taxonomy: An information-based measure and its application to problems of ambiguity in natural language. Journal of Artificial Intelligence Research, 11, 95-130.
22. Ruthven, I. (2003, July-August). Re-examining the potential effectiveness of interactive query expansion. In Proceedings of the 26th Annual International ACM Conference on Research and Development in Information Retrieval (SIGIR) (pp. 213-220). New York, NY: ACM Press.
23. Silberschatz, A., Korth, H.F., & Sudarshan, S. (2006). Database System Concepts (5th ed.) Boston: McGraw-Hill.
24. Srehl, A., Ghosh, J., & Mooney, R. (2000, July). Impact of similiarity measures on web-page clustering. In Proceedings of the AAAI Worshop of Artificial Intelligence for Web Search (pp. 58-64). Cambridge, MA: AAAI/MTT Press.
25. Wu, X., Zhang, C., & Zhang, S. (2004). Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems, 22(3), 381-405.