A Novel Density-Based methods GEP-Cluster Algorithm for Collaborative Filtering

Hong Guo Cai; Chang An Yuan

doi:10.4028/www.scientific.net/AMM.325-326.1521

Paper Titles

Efficient Surface Integral Equation Using Travelling-Standing-Wave Vector Basis Function for Complex EM Scattering Problems
p.1498

A Hash Algorithm Construction Based on Generalized Chaotic Maps
p.1502

Harmonic Analysis Method Based on Power Balance
p.1508

The Calculation and Estimate of Interval-Valued and Fuzzy Dirichlet Series Coefficient
p.1515

A Novel Density-Based methods GEP-Cluster Algorithm for Collaborative Filtering
p.1521

The Location Algorithm Based on Square-Root Cubature Kalman Filter
p.1525

The Implementation of Information Receiving and Sharing of Satellite Cloud Image under the Complex Electromagnetic Environment
p.1530

Rapid Search Algorithms of Local Registering Based on Decimal Tree
p.1535

A New Reptile Method for Contour Tracing Based on an Extended Freeman Code and an Alterable Window
p.1539

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 325-326A Novel Density-Based methods GEP-Cluster...

A Novel Density-Based methods GEP-Cluster Algorithm for Collaborative Filtering

Abstract:

To further solve the expansion performance problems of collaborative filtering technology. Firstly, form a few better center areas by using density partition and numerical distance between objects. Then, use the gene expression programming（GEP） to find the cluster centers. Propose a cluster algorithm of Density-based methods GEP-Cluster (DGEPC) to solve the nearest neighbor problem. Push the GEP technology for the Personalization Recommendation system.

You might also be interested in these eBooks

Manufacturing Engineering and Process II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 325-326)

Pages:

1521-1524

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.325-326.1521

Citation:

Cite this paper

Online since:

June 2013

Authors:

Hong Guo Cai, Chang An Yuan

Keywords:

Cluster, Gene Expression Programming, Personalized Recommendation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] G.Adomavicius,ATuzhilin.Toward the next generation of rec-ommender systems:Asurvey of the state-of-the-art and possible extensions[J] .IEEE Trans on Knowledge and Data Engineer-ing, 2005, 17 (6) :734-749 .

DOI: 10.1109/tkde.2005.99

Google Scholar

[2] Chun Zeng, et al. Si milarity measure andinstance selection for collaborative filtering interna-tional[J] .Journal of Electronic Commerce, 2004, 4 (8) :115-129 .

Google Scholar

[3] CHEN Yu, et al. An Auto-cluster Algorithm Based on Gene Expression Programming[J].Journal of Sichuan University,2007.11,39(6):108-112.

Google Scholar

[4] WU Yan,SHEN Jie, et al. Algorithm for Sparse Problem in Collaborative Filtering [J]. Application Research of Computers, 2007,(06) .

Google Scholar

[5] Agrawal R,Srikant R.Fast algorithms for mining association rules[Z].Proc. Of the 20th VLDB Conference Santiago,Chile,1994.

Google Scholar

[6] ZHANG Jiong, LI Hua. Time weighted collaborative filtering algorithms based on resources category[J].Application Research of Computers,2009/06 , 26(6):2107-2109.

Google Scholar

[7] DONG Li, et al. Collaborative filtering algorithm evaluation for various datasets [J]. Journal of Tsinghua University(Science and Technology).2009,(04).

Google Scholar

[8] BAO Yu-bin, et al Application of Association Rules and Cluster Analysis to Personalized Recommendation [J]. Jounal of northeastern university, 2003,(12).

Google Scholar

[9] Cai Hong-guo, etc. A novel GEP-based multiple-layers association rule mining algorithm. Proceedings - CIS 2010, 68-72.

Google Scholar