Search

Your search keyword '"Wang, Beizhan"' showing total 2 results
2 results on '"Wang, Beizhan"'

1. Sparse online collaborative filtering with dynamic regularization.

Author

Li, Kangkang, Zhou, Xiuze, Lin, Fan, Zeng, Wenhua, Wang, Beizhan, and Alterovitz, Gil

Subjects
*RECOMMENDER systems, *INFORMATION filtering, *INFORMATION retrieval, *MACHINE learning, *DATA analysis
Abstract

Collaborative filtering (CF) approaches are widely applied in recommender systems. Traditional CF approaches have high costs to train the models and cannot capture changes in user interests and item popularity. Most CF approaches assume that user interests remain unchanged throughout the whole process. However, user preferences are always evolving and the popularity of items is always changing. Additionally, in a sparse matrix, the amount of known rating data is very small. In this paper, we propose a method of online collaborative filtering with dynamic regularization (OCF-DR), that considers dynamic information and uses the neighborhood factor to track the dynamic change in online collaborative filtering (OCF). The results from experiments on the MovieLens100K, MovieLens1M, and HetRec2011 datasets show that the proposed methods are significant improvements over several baseline approaches. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

2. A novel ECOC algorithm for multiclass microarray data classification based on data complexity analysis.

Author

Sun, MengXin, Liu, KunHong, Wu, QingQiang, Hong, QingQi, Wang, BeiZhan, and Zhang, Haiying

Subjects
*DATA analysis, *MATRICES (Mathematics), *DATA distribution, *ERROR-correcting codes, *MATHEMATICAL optimization, *PARTITIONS (Mathematics)
Abstract

Highlights • We proposed a novel ECOC algorithm for multiclass microarray data classification based on the data complexity theory. • Various data complexity measures are deployed to detect the intrinsic characteristics of microarray data sets, so as to produce diverse coding matrices. • A new data complexity measure, named as C1, is designed to evaluate data distribution. It benefits the optimization process of our class partition. • The proposed ECOC algorithm performs more stably in most multiclass microarray data sets compared with other popular ECOC algorithms. Abstract Nowadays, a lot of new classification and clustering techniques have been proposed for microarray data analysis. However, the multiclass microarray data classification is still regarded as a tough task because of the small sample size problem and the class imbalance problem. In this paper, we propose a novel error correcting output code (ECOC) algorithm for the classification of multiclass microarray data based on the data complexity (DC) theory. In this algorithm, an ECOC coding matrix is generated based on a hierarchical partition of the class space with the aim of Minimizing Data Complexity (named as ECOC-MDC). As the partition process can be mapped as a binary tree, a compact ensemble with high discrimination power is produced. The performance of ECOC-MDC is compared with some state-of-art ECOC algorithms on six multiclass microarray data sets, and it is found that the proposed algorithm can obtain better results in most cases. The correlation between DC measures and the dichotomizers' performances is checked, and the observations confirm that high complexity in data usually leads to high error rates of the connected dichotomizers. But the error correcting mechanism in the ECOC framework can effectively improve our algorithm's generalization ability. In short, ECOC-MDC can produce a compact ensemble system with high error correction capability through the application of diverse DC measures. Our Matlab code is available at: github.com/MLDMXM2017/ECOC-MDC. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results