Improving the test time of M-distance based recommendation system (Record no. 17510)

000 -LEADER
fixed length control field a
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220913134156.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220913b xxu||||| |||| 00| 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency AIKTC-KRRC
Transcribing agency AIKTC-KRRC
100 ## - MAIN ENTRY--PERSONAL NAME
9 (RLIN) 17876
Author Hasanzadeh, Narges
245 ## - TITLE STATEMENT
Title Improving the test time of M-distance based recommendation system
250 ## - EDITION STATEMENT
Volume, Issue number Vol.103(1), Feb
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New York
Name of publisher, distributor, etc. Springer
Year 2022
300 ## - PHYSICAL DESCRIPTION
Pagination 119-129p.
520 ## - SUMMARY, ETC.
Summary, etc. The M-distance-based recommendation system (MBR) is one of the most successful types of recommendation systems. In the training phase of MBR, the average of ratings given to each item is used to determine similar items. To estimate the active user’s rating on an item in the test phase of MBR, only rated items of the active user are necessary, whereas in MBR, all nearest neighbors of that item are examined and then, unrated neighbors of the active user are ignored. In most datasets, the number of unrated items is very high and, therefore, the most of nearest neighbors are unrated, examining all nearest neighbors in the test phase of MBR is unnecessary and time-wasting. In this paper, a new data structure is proposed to improve the test time of MBR. In the training phase, the rated items of each user are stored in this data structure. By employing this data structure in the test phase, it will be then unnecessary to examine unrated items. Strictly speaking, the nearest neighbor of each unrated item of the active user is determined in the test phase by examining the small set of rated items of the active user stored previously in the data structure. According to the experiments conducted on five real datasets, the runtime of our proposed method is 2.05, 10.68, 132.19 and 21.77 times less than that of MBR for the datasets ML-1 m, ML-10 m, Douban and EachMovie, respectively.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
9 (RLIN) 4642
Topical term or geographic name entry element Humanities and Applied Sciences
700 ## - ADDED ENTRY--PERSONAL NAME
9 (RLIN) 17877
Co-Author Forghani, Yahya
773 0# - HOST ITEM ENTRY
International Standard Serial Number 2250-2106
Title Journal of the institution of engineers (India): Series B
856 ## - ELECTRONIC LOCATION AND ACCESS
URL https://link.springer.com/article/10.1007/s40031-021-00626-1
Link text Click here
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type Articles Abstract Database
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent Location Current Location Shelving location Date acquired Barcode Date last seen Price effective from Koha item type
          School of Engineering & Technology School of Engineering & Technology Archieval Section 2022-09-13 2022-1578 2022-09-13 2022-09-13 Articles Abstract Database
Unique Visitors hit counter Total Page Views free counter
Implemented and Maintained by AIKTC-KRRC (Central Library).
For any Suggestions/Query Contact to library or Email: librarian@aiktc.ac.in | Ph:+91 22 27481247
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha