Effective Data Reduction for Time-Aware Recommender Systems

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ahmadian Yazdi Hadis; Seyyed Mahdavi Chabok Seyyed Javad; KheirAbadi Maryam

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: CONTROL AND OPTIMIZATION IN APPLIED MATHEMATICS Year:2023 | Volume:8 | Issue:1 Page(s): 33-53

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Effective Data Reduction for Time-Aware Recommender Systems

Author(s)

Ahmadian Yazdi Hadis | Seyyed Mahdavi Chabok Seyyed Javad | KheirAbadi Maryam | Issue Writer Certificate

Keywords

Aggregate‎

‎Recommender systems‎

‎Feature selection‎

‎Correlation matrix‎

‎Dataset compression

Abstract

In recent decades, the amount and variety of data have grown rapidly. As a result, data storage, compression, and analysis have become critical subjects in data mining and machine learning.‎ It is essential to achieve accurate compression without losing important data in the process. Therefore, this work proposes an effective data compression method for recommender systems based on the attention mechanism. The proposed method performs data compression on two levels: features and records. It is time-aware and based on time windows, taking into account users' activity and preventing the loss of important data. The resulting technique can be efficiently utilized for deep networks, where the amount of data is a significant challenge. Experimental results demonstrate that this technique not only reduces the amount of data and processing time but also achieves acceptable accuracy.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans