Please enter verification code
Confirm
Searching Similar Books Based on Student’s Preference for Personalized Education
Science Journal of Education
Volume 5, Issue 2, April 2017, Pages: 60-65
Received: Mar. 1, 2017; Accepted: Mar. 9, 2017; Published: Mar. 25, 2017
Views 2130      Downloads 150
Authors
Mingxi Zhang, College of Communication and Art Design, University of Shanghai for Science and Technology, Shanghai, China
Tianxing Liu, College of Communication and Art Design, University of Shanghai for Science and Technology, Shanghai, China
Xiaohong Wang, College of Communication and Art Design, University of Shanghai for Science and Technology, Shanghai, China
Liujie Sun, College of Communication and Art Design, University of Shanghai for Science and Technology, Shanghai, China
Article Tools
Follow on us
Abstract
Personalized education aims to give students a personalized learning schedule according to students’ backgrounds and preferences, and the required learning resources for learning are personalized. On-line bookstore allows students to collect learning recourses on-line through Internet, but the problem of information overload plagues students since it is difficult to find the suitable books with the data becoming diverse and massive. Similarity search aims to find the similar objects to a given query, which can be regarded as a promising solution to the problem of information overload. However, the existing similarity search approaches limit the query into only one object, the students cannot express their preferences personally. In this paper, we proposed a personalized similarity search framework, towards finding the similar books based on student’s preference for personalized education. We build the student-book network based on the students’ ratings for books, and use SimRank to measure the similarities between books according to the student-book network. For satisfying student’s personalized query preference, we allow student to express query with multi-books. A personalized similarity measure is proposed for measuring the similarity between query and candidate book by combining the similarities between books. Experiments on Amazon dataset demonstrate that, when the number of input books are not limited into one, the returned rankings are more consistent with students’ query intentions.
Keywords
Student’s Preference, Personalized Similarity Search, Personalized Education
To cite this article
Mingxi Zhang, Tianxing Liu, Xiaohong Wang, Liujie Sun, Searching Similar Books Based on Student’s Preference for Personalized Education, Science Journal of Education. Vol. 5, No. 2, 2017, pp. 60-65. doi: 10.11648/j.sjedu.20170502.14
Copyright
Copyright © 2017 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
References
[1]
C. Tekin, J. Braun, and M. van der Schaar, “etutor: Online learning for personalized education,” in 2015 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2015, South Brisbane, Queensland, Australia, April 19-24, 2015, pp. 5545–5549.
[2]
T. Morrow, S. S. Sarvestani, and A. R. Hurson, “Algorithmic decision support for personalized education (invited paper),” in 17th IEEE International Conference on Information Reuse and Integration, IRI 2016, Pittsburgh, PA, USA, July 28-30, 2016, 2016, pp. 188–197.
[3]
M. C. Lee, “A novel sentence similarity measure for semantic-based expert systems,” Expert Syst. Appl., vol. 38, no. 5, pp. 6392–6399, 2011.
[4]
C. Liu, “Discriminant analysis and similarity measure,” Pattern Recognition, vol. 47, no. 1, pp. 359–367, 2014.
[5]
C. D. Boom, S. V. Canneyt, S. Bohez, T. Demeester, and B. Dhoedt, “Learning semantic similarity for very short texts,” in IEEE International Conference on Data Mining Workshop, ICDMW 2015, Atlantic City, NJ, USA, November 14-17, 2015, pp. 1229–1234.
[6]
H. Hu, G. Li, Z. Bao, J. Feng, Y. Wu, Z. Gong, and Y. Xu, “Top-k spatio-textual similarity join,” in 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016, pp. 1576–1577.
[7]
F. Chen, C. Lu, H. Wu, and M. Li, “A semantic similarity measure integrating multiple conceptual relationships for web service discovery,” Expert Syst. Appl., vol. 67, pp. 19–31, 2017.
[8]
G. Jeh and J. Widom, “Simrank: a measure of structuralcontext similarity,” in Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-26, 2002, Edmonton, Alberta, Canada, 2002, pp. 538–543.
[9]
W. Xi, E. A. Fox, W. Fan, B. Zhang, Z. Chen, J. Yan, and D. Zhuang, “Simfusion: measuring similarity using unified relationship matrix,” in SIGIR 2005: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Salvador, Brazil, August 15-19, 2005, pp. 130–137.
[10]
P. Zhao, J. Han, and Y. Sun, “P-rank: a comprehensive structural similarity measure over information networks,” in Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 553–562.
[11]
S. Yoon, S. Kim, and S. Park, “C-rank: A link-based similarity measure for scientific literature databases,” Inf. Sci., vol. 326, pp. 25–40, 2016.
[12]
Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu, “Pathsim: Meta path-based top-k similarity search in heterogeneous information networks,” PVLDB, vol. 4, no. 11, pp. 992– 1003, 2011.
[13]
C. Shi, X. Kong, Y. Huang, P. S. Yu, and B. Wu, “Hetesim: A general framework for relevance measure in heterogeneous networks,” IEEE Trans. Knowl. Data Eng., vol. 26, no. 10, pp. 2479–2492, 2014.
[14]
M. Zhang, H. Hu, Z. He, and W. Wang, “Top-k similarity search in heterogeneous information networks with x-star network schema,” Expert Syst. Appl., vol. 42, no. 2, pp. 699–712, 2015.
[15]
A. G. Maguitman, F. Menczer, F. Erdinc, H. Roinestad, and A. Vespignani, “Algorithmic computation and approximation of semantic similarity,” World Wide Web, vol. 9, no. 4, pp. 431–456, 2006.
[16]
H. G. Small, “Co-citation in the scientific literature: A new measure of the relationship betweenf two documents,” Journal of the American Society for Information Science, vol. 24, no. 4, pp. 265–269, 1973.
[17]
M. M. Kessler, “Bibliographic coupling between scientific papers,” American Documentation, vol. 14, pp. 10–25, 1963.
[18]
J. Santisteban and J. Tejada-Cárcamo, “Unilateral jaccard similarity coefficient,” in Proceedings of the First International Workshop on Graph Search and Beyond, GSB 2015, co-located with The 38th Annual SIGIR Conference (SIGIR’15), Santiago, Chile, August 13th, 2015, pp. 23–27.
[19]
P. Li, Y. Cai, H. Liu, J. He, and X. Du, “Exploiting the block structure of link graph for efficient similarity computation,” in Advances in Knowledge Discovery and Data Mining, 13th Pacific-Asia Conference, PAKDD 2009, Bangkok, Thailand, April 27-30, 2009, Proceedings, 2009, pp. 389–400.
[20]
D. Lizorkin, P. Velikhov, M. N. Grinev, and D. Turdakov, ”ccuracy estimate and optimization techniques for simrank computation,” VLDB J., vol. 19, no. 1, pp. 45–66, 2010.
[21]
W. Zheng, L. Zou, Y. Feng, L. Chen, and D. Zhao, “Efficient simrank-based similarity join over large graphs,” PVLDB, vol. 6, no. 7, pp. 493–504, 2013.
[22]
W. Yu, X. Lin, and W. Zhang, “Fast incremental simrank on link-evolving graphs,” in IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, March 31 - April 4, 2014, pp. 304–315.
[23]
W. Yu and J. A. McCann, “Efficient partial-pairs simrank search for large networks,” PVLDB, vol. 8, no. 5, pp. 569-580, 2015.
[24]
M. Zhang, H. Hu, Z. He, L. Gao, and L. Sun, “Efficient link-based similarity search in web networks,” Expert Syst. Appl., vol. 42, no. 22, pp. 8868–8880, 2015.
[25]
J. Leskovec, L. A. Adamic, and B. A. Huberman, “The dynamics of viral marketing,” TWEB, vol. 1, no. 1, 2007.
[26]
K. Järvelin and J. Kekäläinen, “Cumulated gain-based evaluation of ir techniques,” ACM Trans. Inf. Syst., vol. 20, no. 4, pp. 422-446, 2002.
[27]
Y. Ji, H. Ying, J. Tran, P. Dews, R. M. Massanari. Integrating unified medical language system and association mining techniques into relevance feedback for biomedical literature search. BMC Bioinformatics, vol. 17, no. S-9, pp.264, 2016.
[28]
N. Yi, N. Standaert, B. Nemery, K. Dierickx. Research integrity in China: precautions when searching the Chinese literature. Scientometrics, vol. 110, no. 2, pp. 1011-1016, 2017.
[29]
S. Plansangket, J. Q. Gan. Re-ranking Google search returned web documents using document classification scores. Artif. Intell. Research, vol. 6, no. 1, pp. 59-68, 2017.
[30]
R. Song, K. Umemoto, J. Y. Nie, X. Xie, K. Tanaka, Y. Rui. UniClip: Leveraging Web Search for Universal Clipping of Articles on Mobile. Data Science and Engineering, vol. 1, no. 2, pp. 101-113, 2016.
[31]
T. Yamazaki, N. Shimizu, H. Kobayashi, S. Yamauchi. Weighted Micro-Clustering: Application to Community Detection in Large-Scale Co-Purchasing Networks with User Attributes. WWW (Companion Volume), pp. 131-132, 2016.
[32]
M. Jebabli, H. Cherifi, C. Cherifi, A. Hamouda. Overlapping Community Detection Versus Ground-Truth in AMAZON Co-Purchasing Network. The 11th International Conference on Signal-Image Technology & Internet-Based Systems, SITIS 2015, Bangkok, Thailand, November, 2015, pp. 23-27.
[33]
H. Hazimeh, I. Youness, J. Makki, H. Noureddine, J. Tscherrig, E. Mugellini, O. A. Khaled. Leveraging Co-authorship and Biographical Information for Author Ambiguity Resolution in DBLP. The 30th {IEEE} International Conference on Advanced Information Networking and Applications, AINA 2016, Crans-Montana, Switzerland, 23-25 March, 2016, pp. 1080-1084.
[34]
Tinghuai Ma, Huan Rong, Changhong Ying, Yuan Tian, Abdullah Al-Dhelaan, Mznah Al-Rodhaan: Detect structural-connected communities based on BSCHEF in C-DBLP. Concurrency and Computation: Practice and Experience, vol. 28, no. 2, pp. 311-330, 2016.
ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186