Research Article

Personal Recommendation Using a Novel Collaborative Filtering Algorithm in Customer Relationship Management

Table 2

Algorithmic performance for Book-Crossing dataset. The ranking score, precision, recall, intrasimilarity, and hamming distance are corresponding to L = 50,60,70. And the value of parameter is 1.86. Each number presented in this table is obtained by averaging over five runs, each of which has an independently random division of training set and test.

AlgorithmsRanking scorePrecisionRecallIntrasimilarityHamming distance

 CF0.0560.0390.1810.3740.519
 MCF0.0520.0440.1920.3380.547
 NBI0.0490.0470.2040.3160.613
 CF-M0.0430.0510.2170.2630.764
 CF0.0460.0370.2010.3950.511
 MCF0.0440.0420.2140.3520.536
 NBI0.0420.0450.2330.3310.604
 CF-M0.0370.0480.2480.2780.752
 CF0.0420.0320.2280.4210.497
 MCF0.0400.0360.2430.3750.522
 NBI0.0340.0410.2620.3490.587
 CF-M0.0300.0440.2960.2930.731