• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.59-68
• /
• 2022

A recommender system covers users, searches the items or services which users will like, and let users purchase them. Because recommendations from a recommender system are predictions of users' preferences for the items which they do not purchase yet, it is rarely possible to be drawn a perfect answer. An evaluation has been conducted to determine whether a prediction is right or not. However, it can be lower user's satisfaction if a recommender system focuses on only the preferences, that is caused by a 'filter bubble effect'. The filter bubble effect is an algorithmic bias that skews or limits the information an individual user sees on the recommended list. It is the reason why multiple metrics are required to evaluate recommender systems, and a diversity metrics is mainly used for it. In this paper, we compare three different methods for enhancing diversity for personalized recommendation - bin packing, weighted random choice, greedy re-ranking - with a practical e-commerce data acquired from a fashion shopping mall. Besides, we present the difference between experimental results and F1 scores.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.399-404
• /
• 2002

Along the evolution of information and communication technologies, manufacturing embedded systems such as PDA (personal digital assistant), HPC (hand -held PC), settop box. and information appliance became realistic. And RTOS (real-time operating system) and filesystem have been played essential re]os within the embedded systems as well. For the filesystem of embedded systems, flash memory has been used extensively instead of traditional hard disk drives because of embedded system's requirements like portability, fast access time, and low power consumption. Other than these requirements, nonvolatile storage characteristic of flash memory is another reason for wide adoption in industry. However, there are some technical challenges to cope with to use the flash memory as an indispensable component of the embedded systems. These would be relatively slow cleaning time and the limited number of times to write-and-clean. In this paper, a new cleaning policy is proposed to overcome the problems mentioned above and relevant performance comparison results will be provided. Ranking cleaning policy(RCP) decides when and where to clean within the flash memory considering the cost of cleaning and the number of times of cleaning. This method will maximize not only the lifetime of flash memory but also the performance of access time and manageability. As a result of performance comparison, RCP has showed about 10 ~ 50% of performance evolution compared to traditional policies, Greedy and Cost-benefit methods, by write throughputs.