Abstract
Strong points, weak points and interests of students are precious data for their teachers, but it is hard to learn them quickly, especially when students do not cooperate in class. This paper explores a method for analysing queries of students that are allowed to search during class and homework. For this purpose, we first established six hypotheses on the queries and the expertise of the students. Then, we collected 143 queries from several lectures of an IT subject at Kyoto University. 36 students of this subject had previously been profiled before each lecture by means of questionnaires. When we checked our hypotheses against this collection of queries, we found that experts and novices often search the same way, although experts send more queries about different subjects. Some students also search contents that the teacher has not presented yet.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
White, R.W., Huang, J.: Assessing the scenic route: measuring the value of search trails in web logs. In: Proceedings of SIGIR 2010, pp. 587–594 (2010)
Liu, Y., Song, R., Chen, Y., Nie, J.Y., Wen, J.R.: Adaptive Query Suggestion for Difficult Queries. In: Proceedings of SIGIR 2012, pp. 15–24 (2012)
Cui, H., Wen, J.R., Nie, J.Y., Ma, W.Y.: Probabilistic Query Expansion Using Query Logs. In: Proceedings of the 11th International Conference on World Wide Web (2002)
Duarte Torres, S., Hiemstra, D., Serdyukov, P.: Query log analysis in the context of information retrieval for children. In: 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval (2010)
Pu, H.T., Chuang, S.L., Yang, C.: Subject categorization of query terms for exploring Web users’ search interests. Journal of the American Society for Information Science and Technology 53(8), 617–630 (2002)
Limam, L., Coquil, D., Kosch, H., Brunie, L.: Extracting User Interests from Search Query Logs: A Clustering Approach. In: Proceedings of DEXA Workshops 2010, pp. 5–9 (2010)
Liu, H.: Learning by Searching. In: McFerrin, K., et al. (eds.) Proceedings of Society for Information Technology & Teacher Education International Conference 2008, pp. 3843–3844. AACE, Chesapeake (2008)
Howard, P., Massanari, A.: Learning to search and searching to learn: Income, education, and experience online. Journal of Computer-Mediated Communication 12(3), article 5 (2007)
Buscher, G., White, R.W., Dumais, S.T., Huang, J.: Large-scale analysis of individual and task differences in search result page examination strategies. In: Proceedings of WSDM 2012, pp. 373–382 (2012)
Broder, A.: A taxonomy of web search. ACM SIGIR Forum 36(2), 3–10 (2002)
Rose, D.E., Levinson, D.: Understanding User Goals in Web Search. In: Proceedings of the World Wide Web Conference (WWW 2004), pp. 13–19 (2004)
Song, R., Zhang, M., Sakai, T., Kato, M.P., Liu, Y., Sugimoto, M., Wang, Q., Orii, N.: Overview of the NTCIR-9 Intent task. In: Proceedings of NTCIR (2011)
Lazonder, A.W., Biemans, H., Wopereis, I.: Difference between novice and experienced users in searching information on the World Wide Web. Journal of the American Society for Information Science 51(6), 576–581 (2000)
Aula, A., Jhaveri, N., Käki, M.: Information search and re-access strategies of experienced web users. In: Proceedings of WWW, pp. 583–592 (2005)
White, R.W., Dumais, S.T., Teevan, J.: Characterizing the Influence of Domain Expertise on Web Search Behavior. In: Proceedings of WSDM 2009, pp. 373–382 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
López-García, R., Kato, M.P., Yamakata, Y., Tanaka, K. (2013). How Do Students Search during Class and Homework?. In: Jatowt, A., et al. Social Informatics. SocInfo 2013. Lecture Notes in Computer Science, vol 8238. Springer, Cham. https://doi.org/10.1007/978-3-319-03260-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-03260-3_39
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03259-7
Online ISBN: 978-3-319-03260-3
eBook Packages: Computer ScienceComputer Science (R0)