茄子在线看片免费人成视频,午夜福利精品a在线观看,国产高清自产拍在线观看,久久综合久久狠狠综合

    <s id="ddbnn"></s>
  • <sub id="ddbnn"><ol id="ddbnn"></ol></sub>

  • <legend id="ddbnn"></legend><s id="ddbnn"></s>

    C#實現(xiàn)協(xié)同過濾算法的實例代碼
    來源:易賢網(wǎng) 閱讀:1965 次 日期:2014-09-05 15:36:49
    溫馨提示:易賢網(wǎng)小編為您整理了“C#實現(xiàn)協(xié)同過濾算法的實例代碼”,方便廣大網(wǎng)友查閱!

    這篇文章介紹了C#實現(xiàn)協(xié)同過濾算法的實例代碼,有需要的朋友可以參考一下

    代碼如下:

    using System;

    using System.Collections.Generic;

    using System.Linq;

    using System.Text;

    namespace SlopeOne

    {

    public class Rating

    {

    public float Value { get; set; }

    public int Freq { get; set; }

    public float AverageValue

    {

    get { return Value / Freq; }

    }

    }

    public class RatingDifferenceCollection : Dictionary<string, Rating>

    {

    private string GetKey(int Item1Id, int Item2Id)

    {

    return (Item1Id < Item2Id) ? Item1Id + "/" + Item2Id : Item2Id + "/" + Item1Id ;

    }

    public bool Contains(int Item1Id, int Item2Id)

    {

    return this.Keys.Contains<string>(GetKey(Item1Id, Item2Id));

    }

    public Rating this[int Item1Id, int Item2Id]

    {

    get {

    return this[this.GetKey(Item1Id, Item2Id)];

    }

    set { this[this.GetKey(Item1Id, Item2Id)] = value; }

    }

    }

    public class SlopeOne

    {

    public RatingDifferenceCollection _DiffMarix = new RatingDifferenceCollection(); // The dictionary to keep the diff matrix

    public HashSet<int> _Items = new HashSet<int>(); // Tracking how many items totally

    public void AddUserRatings(IDictionary<int, float> userRatings)

    {

    foreach (var item1 in userRatings)

    {

    int item1Id = item1.Key;

    float item1Rating = item1.Value;

    _Items.Add(item1.Key);

    foreach (var item2 in userRatings)

    {

    if (item2.Key <= item1Id) continue; // Eliminate redundancy

    int item2Id = item2.Key;

    float item2Rating = item2.Value;

    Rating ratingDiff;

    if (_DiffMarix.Contains(item1Id, item2Id))

    {

    ratingDiff = _DiffMarix[item1Id, item2Id];

    }

    else

    {

    ratingDiff = new Rating();

    _DiffMarix[item1Id, item2Id] = ratingDiff;

    }

    ratingDiff.Value += item1Rating - item2Rating;

    ratingDiff.Freq += 1;

    }

    }

    }

    // Input ratings of all users

    public void AddUerRatings(IList<IDictionary<int, float>> Ratings)

    {

    foreach(var userRatings in Ratings)

    {

    AddUserRatings(userRatings);

    }

    }

    public IDictionary<int, float> Predict(IDictionary<int, float> userRatings)

    {

    Dictionary<int, float> Predictions = new Dictionary<int, float>();

    foreach (var itemId in this._Items)

    {

    if (userRatings.Keys.Contains(itemId)) continue; // User has rated this item, just skip it

    Rating itemRating = new Rating();

    foreach (var userRating in userRatings)

    {

    if (userRating.Key == itemId) continue;

    int inputItemId = userRating.Key;

    if (_DiffMarix.Contains(itemId, inputItemId))

    {

    Rating diff = _DiffMarix[itemId, inputItemId];

    itemRating.Value += diff.Freq * (userRating.Value + diff.AverageValue * ((itemId < inputItemId) ? 1 : -1));

    itemRating.Freq += diff.Freq;

    }

    }

    Predictions.Add(itemId, itemRating.AverageValue);

    }

    return Predictions;

    }

    public static void Test()

    {

    SlopeOne test = new SlopeOne();

    Dictionary<int, float> userRating = new Dictionary<int, float>();

    userRating.Add(1, 5);

    userRating.Add(2, 4);

    userRating.Add(3, 4);

    test.AddUserRatings(userRating);

    userRating = new Dictionary<int, float>();

    userRating.Add(1, 4);

    userRating.Add(2, 5);

    userRating.Add(3, 3);

    userRating.Add(4, 5);

    test.AddUserRatings(userRating);

    userRating = new Dictionary<int, float>();

    userRating.Add(1, 4);

    userRating.Add(2, 4);

    userRating.Add(4, 5);

    test.AddUserRatings(userRating);

    userRating = new Dictionary<int, float>();

    userRating.Add(1, 5);

    userRating.Add(3, 4);

    IDictionary<int, float> Predictions = test.Predict(userRating);

    foreach (var rating in Predictions)

    {

    Console.WriteLine("Item " + rating.Key + " Rating: " + rating.Value);

    }

    }

    }

    }

    更多信息請查看IT技術(shù)專欄

    更多信息請查看網(wǎng)絡(luò)編程
    易賢網(wǎng)手機網(wǎng)站地址:C#實現(xiàn)協(xié)同過濾算法的實例代碼

    2026上岸·考公考編培訓(xùn)報班

    • 報班類型
    • 姓名
    • 手機號
    • 驗證碼
    關(guān)于我們 | 聯(lián)系我們 | 人才招聘 | 網(wǎng)站聲明 | 網(wǎng)站幫助 | 非正式的簡要咨詢 | 簡要咨詢須知 | 新媒體/短視頻平臺 | 手機站點 | 投訴建議
    工業(yè)和信息化部備案號:滇ICP備2023014141號-1 云南省教育廳備案號:云教ICP備0901021 滇公網(wǎng)安備53010202001879號 人力資源服務(wù)許可證:(云)人服證字(2023)第0102001523號
    聯(lián)系電話:0871-65099533/13759567129 獲取招聘考試信息及咨詢關(guān)注公眾號:hfpxwx
    咨詢QQ:1093837350(9:00—18:00)版權(quán)所有:易賢網(wǎng)