|Author||Hao Zang ♦ Yue Xu ♦ Yuefeng Li|
|Source||IEEE Xplore Digital Library|
|Publisher||Institute of Electrical and Electronics Engineers, Inc. (IEEE)|
|Subject Domain (in DDC)||Computer science, information & general works ♦ Special computer methods|
|Subject Keyword||Navigation ♦ Databases ♦ closed sequence ♦ non-redundant sequential rule mining ♦ Generators ♦ Association rules ♦ History ♦ Recommender systems ♦ Recommender system ♦ sequence generator|
|Abstract||Many modern recommender systems are not suitable for recommending infrequently purchased products such as cars due to lack of user rating data to infrequently purchased products. A big challenge for recommending infrequently purchased products is the lack of data about users' interests. Web log data is an important data resource to derive useful information about users' navigation patterns which in turn can help find users' information needs. In this paper, a novel method Closed Sequence-Sequence Generator Mining (CSGM) is proposed to generate closed sequences and sequence generators for non-redundant sequential rule mining. By applying the proposed method on web logs, we can extract sequential associations among products which reflect users' preference on products. We have conducted experiments on recommending cars based on users' interests generated by utilizing the sequential rules extracted using our method. Our experiments show that by using those rules we can find users' interests more accurately and thus improve the quality of car recommendation compared to the standard matching-based car search. Moreover, by only using the non-redundant rules, the same or even better recommendations can be generated than using the whole set of rules.|
|Educational Role||Student ♦ Teacher|
|Age Range||above 22 year|
|Educational Use||Research ♦ Reading|
|Education Level||UG and PG|
|Learning Resource Type||Article|
|Rights Holder||Institute of Electrical and Electronics Engineers, Inc. (IEEE)|
|Size (in Bytes)||367.89 kB|
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
For any issue or feedback, please write to email@example.com