Package com.rapidminer.data

Examples of com.rapidminer.data.IMatrix_b

51
52
53
54
55
56
57
58
59
60
61
     
      super.AddRatings(users, items, ratings);
      correlation.Grow(correlation.NumberOfRows()+users.size(), correlation.NumberOfColumns()+users.size());
      correlation.Setnum_entities(MaxUserID+1);
     
      IMatrix_b transpose = data_user.Transpose();
     
      SparseMatrix overlap = new SparseMatrix(data_user.NumberOfRows(), data_user.NumberOfRows());
      com.rapidminer.data.CompactHashSet<Integer> viewed=new com.rapidminer.data.CompactHashSet<Integer>();
      int prevus=-1;
     
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
    super.AddRatings(users, items, ratings);
   
    correlation.Grow(MaxItemID+1, MaxItemID+1);
     correlation.Setnum_entities(MaxItemID+1);
    
     IMatrix_b transpose = data_item.Transpose();

     
      SparseMatrix overlap = new SparseMatrix(data_item.NumberOfRows(), data_item.NumberOfRows());
      com.rapidminer.data.CompactHashSet<Integer> viewed=new com.rapidminer.data.CompactHashSet<Integer>();
      int prevus=-1;
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
     
      if(users==null || items==null)
        return 1;
     
      if(users.size()!=0){
      IMatrix_b transpose = GetFeedback().GetItemMatrix().Transpose();
      SparseMatrix overlap = new SparseMatrix(GetFeedback().GetItemMatrix().NumberOfRows(), GetFeedback().GetItemMatrix().NumberOfRows());
      com.rapidminer.data.CompactHashSet<Integer> viewed=new com.rapidminer.data.CompactHashSet<Integer>();
      int prevus=-1;
     
      for(int i1=0;i1<users.size();i1++)//users list must be sorted
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
     
      if(users==null || items==null)
        return 1;
     
      if(items.size()!=0){
        IMatrix_b transpose = GetFeedback().GetUserMatrix().Transpose();
        SparseMatrix overlap = new SparseMatrix(GetFeedback().GetUserMatrix().NumberOfRows(), GetFeedback().GetUserMatrix().NumberOfRows());
        com.rapidminer.data.CompactHashSet<Integer> viewed=new com.rapidminer.data.CompactHashSet<Integer>();
        int prevus=-1;
       
        for(int i1=0;i1<items.size();i1++)//should be item sorted
View Full Code Here
TOP

Related Classes of com.rapidminer.data.IMatrix_b

  • com.rapidminer.ItemRecommendation._itemKnn
  • com.rapidminer.ItemRecommendation._userKnn
  • com.rapidminer.operator.RatingPrediction.ItemKnnCosine
  • com.rapidminer.operator.RatingPrediction.UserKnnCosine
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.