filtering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
|
|
- Lindsey Rodgers
- 6 years ago
- Views:
Transcription
1 107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays, customers spen much time an effort in fining the best suitable goos since more an more information is place online To save their time an effort in searching the goos they want, a customize recommener system is require In this paper we present an improve neighbor selection algorithm that exploits a graph approach The graph approach allows us to exploit the transitivity of similarities The algorithm searches more efficiently for set of influential customers with respect to a given customer We compare the propose recommenation algorithm with other neighbor selection methos The experimental results show that the propose algorithm outperforms other methos key wors: recommener system, neighbor selection algorithm, collaborative filtering 1 Introuction Nowaays, customers spen much time an effort in fining the best suitable goos since more an more information is place on-line To save their time an effort in searching the goos they want, a customize recommener system is require A customize recommener system shoul preict the most suitable goos for customers by retrieving an analyzing their preferences A recommener system utilizes in general an information filtering technique calle collaborative filtering Collaborative filtering is wiely use for such recommener systems as Amazoncom an CD- Nowcom [1] [4] A recommener system using collaborative filtering which we call CF, is base on the ratings of the customers who have similar preferences with respect to agiven(test)customer CF calculates the similarity between the test customer an every other customer who has rate the items that are alreay rate by the test customer CF uses in general the Pearson correlation coefficient for calculating the similarity A weak point of the pure CF is that it uses all other customers incluing useless customers as the neighbors of the test customer Since CF is base on the ratings of the neighbors who have similar preferences, it is very important to select the neighbors properly to improve preiction quality There have been many investigations on how to select proper neighbors base on neighbor selection methos such as the nearest metho an the clustering-base metho They are quite popular techniques for recommener sys- Manuscript receive June 3, 004 Manuscript revise November 3, 004 The authors are with the Dept of Computer Science, Yonsei Univ, Korea a) kimthun@csyonseiackr b) yang@csyonseiackr DOI: /ietisy/e tems These techniques then preict customer s preferences for the items base on the results of the neighbors evaluation on the same items [1], [4] [6], [9] With millions of customers an items, a recommener system running on an existing algorithm will sufferseriously the scalability problem Therefore, there are emans for a new approach that can quickly prouce high quality preictions an can resolve the very large-scale problem Clustering techniques often lea to worse accuracy than other methos [7], [9], [1] Once clustering is one, however, performance can be very goo, since the size of a cluster that must be analyze is much smaller Therefore the clustering-base metho can solve the very large-scale problem in recommener systems In this paper we present an improve recommenation algorithm using a graph approach The propose algorithm applies the k-means clustering metho to the input ataset for fining a hanful of promising clusters each of which hols a set of customers with influential similarities for the test customer It then searches the promising clusters, as if they are graphs, in a breath-first manner to extract certain customers, calle the neighbors, whohaveeitherhigher similarities or lower similarities with respect to the test customer A cluster is consiere a graph in which vertices are customers an each ege has a weight representing the similarity between the en points(customers) of the ege The graph approach allows us to exploit the transitivity of similarities To compare the performance of the clustering-base metho with that of our metho, the EachMovie ataset of the Compaq Computer Corporation has been use [10] The EachMovie ataset consists of,811,983 preferences for 1,68 movies rate by 7,916 customers explicitly The experimental results show that the propose recommenation algorithm provies better preiction quality than other methos The rest of this paper is organize as follows Section escribes briefly CF an the clustering-base neighbor selection metho Section 3 illustrates the propose neighbor selection algorithm in etail In Sect 4, the experimental results are presente The conclusions are given in Sect 5 Clustering-Base Neighbor Selection in CF 1 Collaborative Filtering CF recommens items through builing the profiles of the Copyright c 005 The Institute of Electronics, Information an Communication Engineers
2 LETTER 1073 customers from their preferences for each item In CF, preferences are represente generally as numeric values which are rate by the customers Preicting the preference for a certain item that is new to the test customer is base on the ratings of other customers for the target item Therefore, it is very important to fin a set of customers, calle neighbors, with more similar preferences to the test customer for better preiction quality In CF, Eq (1) is use to preict the preference of a customer Note that in the following equation w a,k is the Pearson correlation coefficient as in Eq () [] [5], [7] {w a,k (r k,i r k )} P a,i = r a + w a,k = k w a,k k (r a, r a )(r k, r k ) (1) () (r a, r a ) (r k, r k ) In the above equations P a,i is the preference of customer a with respect to item i r a an r k are the averages of customer a s ratings an customer k s ratings, respectively r k,i an r k, are customer k s ratings for items i an, respectively, an r a, is customer a s rating for item If customers a an k have similar ratings for an item, w a,k > 0 We enote w a,k to inicate how much customer a tens to agree with customer k on the items that both customers have alreay rate In this case, customer a is a positive neighbor with respect to customer k, an vice versa If they have opposite ratings for an item, then w a,k < 0 Similarly, customer a is a negative neighbor with respect to customer k, an vice versa In this case w a,k inicates how much they ten to isagree on the item that both again have alreay rate Hence, if they on t correlate each other, then w a,k = 0 Note that w a,k can be in between -1 an 1 inclusive The Clustering-Base Neighbor Selection The k-means clustering metho creates k clusters each of which consists of the customers who have similar preferences among themselves In this metho we first select k customers arbitrarily as the initial center points of the k clusters, respectively Then each customer is assigne to a cluster in such a way that the istance between the customer an the center of a cluster is minimize The istance is calculate using the Eucliean istance, that is, a square root of the element-wise square of the ifference between the customer an each center point We then calculate the mean of each cluster base on the customers who currently belong to the cluster The mean is now consiere as the new center of the cluster After fining the new center of each cluster, we compute the istance between the new center an each customer as before in orer to fin the cluster to which the customer shoul belong Recalculating the means an computing the istances are repeate until a terminating conition is met The conition is in general how far each new center has move from the previous center; that is, if all the new centers move within a certain istance, we terminate the loop If the clustering process is terminate, we choose the cluster with the shortest Eucliean istance from its center to the test customer Finally, preiction for the test customer is calculate with all the customers in the chosen cluster The clustering-base neighbor selection metho can give a recommenation quickly to the customer in case of the very large-scale ataset, because it selects customers in the best cluster only as neighbors [9] 3 The Propose Neighbor Selection Algorithm We first escribe a neighbor selection algorithm(nsa) in [8] It consiers both high an low similarities with respect to the test customer an exploits the transitivity of similarity using a graph approach We then explain the computational complexity of the NSA 31 NSA The key ieas of NSA are to exploit the transitivity of similarities an to consier both higher an lower similarities in selecting neighbors We regar a portion of the input ataset a complete unirecte graph in which a vertex represents each customer an a weighte ege correspons to the similarity between two en points(customers) of the ege NSA creates k clusters from the input ataset with the k-means clustering metho Then it fins the best cluster C with respect to the test customer u among the k clusters NSA searches the customers in C to fin the best vertex v with the highest similarity with respect to u NSA then searches the unmarke vertices aacent to v who have the similarities either larger than H or smaller than L, where H an L are some threshol values for the Pearson correlation coefficients Note that as the threshol values change, so oes the size of the neighbors The search is performe in a breath-first manner That is, we search the aacent vertices of v accoring to H an L to fin the neighbors of u, an then search the aacent vertices of each neighbor of v in turn The search stops when we have enough neighbors for preiction Figure 1 epicts an example of how NSA selects the neighbors of v who has the higher similarities with respect to u when the search epth is A soli line inicates that the weight on the ege is larger than H A otte line means that the weight of the ege is smaller than L We now escribe NSA in etail In the algorithm, before we apply the graph approach to the input ataset, we want to remove insignificant customers with the k-means clustering metho After we obtain k clusters with the k- means clustering metho, we choose a cluster (the best
3 1074 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 (a) Assume that v has the highest similarity for the test customer Fig 1 (b) After fining the neighbors of v (the search epth=1) (c) After selecting the neighbors of each neighbor of v (the search epth=) An example of searching the neighbors in NSA cluster) whose mean has the highest similarity with respect to the test customer u We then apply the graph approach only to the best cluster The following escribes the overall algorithm in etail When the algorithm is terminate, the set Neighbors is returne as output The Neighbor Selection Algorithm Input: the test customer u, the input ataset S Output: Neighbors 1 Create k clusters from S with the k-means clustering metho; Fin the best cluster C for the test customer u; 3 Fin the best customer v in cluster C who has the highest similarity with respect to u; 4 A v to Neighbors; 5 Traverse C from v in a breath-first manner when visiting vertices(customers) The similarity of the customer is checke to see if it is either higher than H or lower than L If so, a the customer to Neighbors; Note that Step5 is execute until we get enough neighbors an such terminating conition can be impose with how many levels(epths) we search from v in a breath-first manner 3 The Computational Complexity of the NSA The k-means clustering algorithm is arguably the most wellknown clustering algorithm in use toay Its computational complexity is O(krn), where k is the number of esire clusters, r is the number of iterations, an n is the size of the ataset [11] In collaborative filtering the complexity for the preiction epens on the size of the neighbors Therefore, if we consier all the points (customers) in the chosen cluster (the best cluster) as the neighbors, the complexity is only O(c), where c is the size of the chosen cluster The complexity of the breath-first search (BFS) in a complete unirecte graph is O(n ), where n is the size of the vertex set NSA searches the neighbors with transitivity in a graph using BFS an stops the search if the search epth is greater than a threshol value preetermine BFS for the neighbors using the transitivity mechanism in a complete unirecte graph takes O(n), where is the search epth If we consier only the chosen cluster, the search complexity is O(c) Although NSA searches the neighbors using BFS, it searches only not selecte vertices, that is, all vertices selecte as the neighbors in the previous search steps are consiere as the selecte vertices Therefore, the complexity T(c) of NSA can be compute with (3) T(c) is erive from T = T 1 +T ++T,whereT is the complexity when the search epth is T(c) is compute by each step of the following appenix In (3) an the appenix S is the number of the selecte vertices when the search epth is an S i is the number of the selecte vertices for each vertex i of S 1 For each epth if there is only one selecte vertex, then T(c) iso(c), which is the worst case If all vertices are selecte when the search epth is one, then T(c)isO(c), which is the best case 1 T(c) = (S 1 (c S i )) S 1 1 ( (S 1 i)s i ), (3) where S 0 = 1, S = c, an i S i = S 4 Experimental Results 41 Experiment Environment In orer to evaluate the preiction accuracy of the propose recommenation algorithm, we use the EachMovie ataset of the Digital Equipment Corporation for experiments [10] The EachMovie ataset consists of,811,983 preferences for 1,68 movies rate by 7,916 customers explicitly The customer preferences are represente as numeric values from 0 to 1 at an interval of 0, ie, 00, 0, 04, 06, 08, an 1 In the EachMovie ataset, one of the valuable attributes of an item is the genre of a movie There are 10 ifferent genres such as action, animation, artforeign, classic, comey, rama, family, horror, romance, an thriller For the experiment, we retrieve 3,763 customers who rate at least 100 movies among all the customers in the ataset We have chosen ranomly 50 customers as the test customers an the rest customers are the training customers For each test customer, we chose 5 movies ranomly that are actually rate by the test customer as the test movies The final experimental results are average over the results of the test sets 4 Experimental Metrics One of the statistical preiction accuracy metrics for evaluating recommener systems is the mean absolute error(mae) which is the mean of the errors of the actual customer ratings against the preicte ratings in iniviual preiction [1], [5] [7] MAE is compute by (4) In the equation, N is the total number of preictions an ε i is the error
4 LETTER 1075 Table 1 Methos MAE Parameters Experimental results PCF kmcf k = 1 GCF H = 08, = NSA k = 1, H = 07, L = 08, = Fig The sensitivity of the number of clusters k between the preicte rating an the actual rating for item i The lower MAE is, the more accurate preiction with respect to the numerical ratings of customers we get E = N ε i i=0 N 43 Experimental Results (4) We compare the propose recommenation algorithm with two other methos The first metho is the pure collaborative filtering metho (PCF) use by the GroupLens [], [3] PCF consiers all the customers in the input ataset as neighbors without clustering The secon metho is a moifie PCF that utilizes the k-means clustering which we call kmcf For the propose algorithm we have two ifferent settings The first one is NSA The other is NSA without clustering which we call GCF The experimental results are shown in Table 1 We etermine that k=1 for both kmcf an NSA through various experiments That is, this value for k gave us the smallest MAE value among others as shown in Fig Among the parameters in the table, L an H enote that the threshol values for the Pearson correlation coefficients For example, if L = 08 anh = 07, then we select a neighbor whose similarity is either smaller than 08orlargerthan07 In the table is a search epth The results in the table show that NSA outperforms others when the search epth is We foun that when the search epth is grater than, NSA i not provie better results, because as the size of the neighbors gets larger the chances that unnecessary customers are inclue in the neighbors get higher Table 1 also shows that the methos with the graph approach using transitivity of similarities which are GCF an NSA, fin valuable neighbors in both PCF an kmcf 5 Conclusions It is crucial for a recommener system to have the capability of making accurate preiction by retrieving an analyzing customers preferences Collaborative filtering is wiely use for recommener systems Hence various efforts to overcome its rawbacks have been mae to improve preiction quality It is important to select neighbors properly in orer to make up the weak points in collaborative filtering an to improve preiction quality In this paper we propose an improve neighbor selection algorithm that fins meaningful neighbors using a graph approach along with clustering The experimental results show the propose algorithm provies the better preiction quality than other methos The propose metho utilizes a clustering technique an transitivity mechanism Therefore, it can be a choice to solve the very large-scale problem because it reuces the search space using clustering for a large ataset an also prouces high preiction quality using the transitivity of similarities The complexity of the propose metho is not high However, it may be increase a little more than that of a clustering metho in the worst case Acknowlegments We thank the Compaq Equipment Corporation for permitting us to use the EachMovie ataset This work was supporte by the Brain Korea 1 Proect in 004 References [1] BM Sarwar, G Karypis, JA Konstan, an JT Riele, Application of imensionality reuction in recommener system A case stuy, Proc ACM WebKDD 000 Web Mining for E-Commerce Workshop, pp8 90, 000 [] J Konstan, B Miller, D Maltz, J Herlocker, L Goron, an J Riel, GroupLens: Applying collaborative filtering to usenet news, Commun ACM, vol40, pp77 87, 1997 [3] P Resnick, N Iacovou, M Suchak, P Bergstrom, an J Riel, GroupLens: An open architecture for collaborative filtering of netnews, Proc ACM CSCW94 Conference on Computer Supporte Cooperative Work, pp , 1994 [4] BM Sarwar, G Karypis, JA Konstan, an JT Riel, Analysis of recommenation algorithms for E-commerce, Proc ACM E- commerce 000 Conference, pp , 000 [5] JL Herlocker, JA Konstan, A Borchers, an J Riel, An algorithmic framework for performing collaborative filtering, Proc n International ACM SIGIR Conference on Research an Development in Information Retrieval, pp30 37, 1999 [6] M O Connor an J Herlocker, Clustering items for collaborative filtering, Proc ACM SIGIR Workshop on Recommener Systems, 1999 [7] JS Breese, D Heckerman, an C Kaie, Empirical analysis of preictive algorithms for collaborative filtering, Proc Conference on Uncertainty in Artificial Intelligence, pp43 5, 1998 [8] T-H Kim, Y-S Ryu, S-I Park, an S-B Yang, An improve recommenation algorithm in collaborative filtering, Lecture Notes
5 1076 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 in Computer Science, vol455, pp54 61, 00 [9] BM Sarwar, G Karypis, J A Konstan, an JT Riele, Recommener systems for large-scale e-commerce: Scalable neighborhoo formation using clustering, Proc Fifth International Conference on Computer an Information Technology, 00 [10] S Glassman, EachMovie collaborative filtering ata set, Compaq Computer Corporation, url: compaqcom/src/eachmovie/ 1997 [11] S Kantabutra, Cluster computing as a tool in theoretical computer science, Proc National Workshop on Cluster Coputing 003, pp1 16, 003 [1] T-H Kim an S-B Yang, Using attributes to improve preiction quality in collaborative filtering, Lecture Notes in Computer Science, vol318, pp1 10, 004 Appenix: The computational complexity T(c) T(c) = T = T 1 + T + + T S 0 = 1, S = c, an S i = S T 1 = c S 1 T = T i = T 1 + T + + T S 1 = S 1 (c S 1 ) (S 1 1)S 1 (S 1 )S (S 1 (S 1 1))S S 1 1 i T 1 = c S 1, T = c S 1 S 1,, T S 1 = c S 1 S 1 S S S 1 1 S 1 T = T i = T 1 + T + + T S 1 = S 1 (c S 1 S S 1 ) (S 1 1)S 1 (S 1 )S (S 1 (S 1 1))S S 1 1 T 1 = c S 1 S S 1, T = c S 1 S S 1 S 1, T S 1 = c S 1 S S 1 S 1 S S S 1 1 T(c) = T = T 1 + T + + T 1 = (S 1 (c S i )) S 1 1 ( (S 1 i)s i )
A Time-based Recommender System using Implicit Feedback
A Time-based Recommender System using Implicit Feedback T. Q. Lee Department of Mobile Internet Dongyang Technical College Seoul, Korea Abstract - Recommender systems provide personalized recommendations
More informationComparison of Recommender System Algorithms focusing on the New-Item and User-Bias Problem
Comparison of Recommender System Algorithms focusing on the New-Item and User-Bias Problem Stefan Hauger 1, Karen H. L. Tso 2, and Lars Schmidt-Thieme 2 1 Department of Computer Science, University of
More informationCollaborative Filtering using a Spreading Activation Approach
Collaborative Filtering using a Spreading Activation Approach Josephine Griffith *, Colm O Riordan *, Humphrey Sorensen ** * Department of Information Technology, NUI, Galway ** Computer Science Department,
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationUninformed search methods
CS 1571 Introuction to AI Lecture 4 Uninforme search methos Milos Hauskrecht milos@cs.pitt.eu 539 Sennott Square Announcements Homework assignment 1 is out Due on Thursay, September 11, 014 before the
More informationA Constrained Spreading Activation Approach to Collaborative Filtering
A Constrained Spreading Activation Approach to Collaborative Filtering Josephine Griffith 1, Colm O Riordan 1, and Humphrey Sorensen 2 1 Dept. of Information Technology, National University of Ireland,
More informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
More information1 Surprises in high dimensions
1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationDivide-and-Conquer Algorithms
Supplment to A Practical Guie to Data Structures an Algorithms Using Java Divie-an-Conquer Algorithms Sally A Golman an Kenneth J Golman Hanout Divie-an-conquer algorithms use the following three phases:
More informationTHE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM
International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationAPPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly
International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationLearning Polynomial Functions. by Feature Construction
I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate
More informationData Mining: Clustering
Bi-Clustering COMP 790-90 Seminar Spring 011 Data Mining: Clustering k t 1 K-means clustering minimizes Where ist ( x, c i t i c t ) ist ( x m j 1 ( x ij i, c c t ) tj ) Clustering by Pattern Similarity
More informationResearch Article Research on Law s Mask Texture Analysis System Reliability
Research Journal of Applie Sciences, Engineering an Technology 7(19): 4002-4007, 2014 DOI:10.19026/rjaset.7.761 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitte: November
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationMultilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis
Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT
More informationFeature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory
Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationNEWTON METHOD and HP-48G
NEWTON METHOD an HP-48G DE TING WU DEPART. of MATH. MOREHOUSE COLLEGE I. Introuction Newton metho is an often-use proceure to fin the approximate values of the solutions of an equation. Now, it is covere
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationNEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES
More informationRough Set Approach for Classification of Breast Cancer Mammogram Images
Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationd 3 d 4 d d d d d d d d d d d 1 d d d d d d
Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationInvestigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal
991 Investigation into a new incremental forming process using an ajustable punch set for the manufacture of a oubly curve sheet metal S J Yoon an D Y Yang* Department of Mechanical Engineering, Korea
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationRobustness and Accuracy Tradeoffs for Recommender Systems Under Attack
Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference Robustness and Accuracy Tradeoffs for Recommender Systems Under Attack Carlos E. Seminario and
More informationDesign of Policy-Aware Differentially Private Algorithms
Design of Policy-Aware Differentially Private Algorithms Samuel Haney Due University Durham, NC, USA shaney@cs.ue.eu Ashwin Machanavajjhala Due University Durham, NC, USA ashwin@cs.ue.eu Bolin Ding Microsoft
More informationShort-term prediction of photovoltaic power based on GWPA - BP neural network model
Short-term preiction of photovoltaic power base on GWPA - BP neural networ moel Jian Di an Shanshan Meng School of orth China Electric Power University, Baoing. China Abstract In recent years, ue to China's
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More informationNew Version of Davies-Bouldin Index for Clustering Validation Based on Cylindrical Distance
New Version of Davies-Boulin Inex for lustering Valiation Base on ylinrical Distance Juan arlos Roas Thomas Faculta e Informática Universia omplutense e Mari Mari, España correoroas@gmail.com Abstract
More informationClassification and clustering methods for documents. by probabilistic latent semantic indexing model
A Short Course at amang University aipei, aiwan, R.O.C., March 7-9, 2006 Classification an clustering methos for ocuments by probabilistic latent semantic inexing moel Shigeichi Hirasawa Department of
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University
More informationThe Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract
The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie
More informationFast Window Based Stereo Matching for 3D Scene Reconstruction
The International Arab Journal of Information Technology, Vol. 0, No. 3, May 203 209 Fast Winow Base Stereo Matching for 3D Scene Reconstruction Mohamma Mozammel Chowhury an Mohamma AL-Amin Bhuiyan Department
More informationImage compression predicated on recurrent iterated function systems
2n International Conference on Mathematics & Statistics 16-19 June, 2008, Athens, Greece Image compression preicate on recurrent iterate function systems Chol-Hui Yun *, Metzler W. a an Barski M. a * Faculty
More informationPrivacy-Preserving Collaborative Filtering using Randomized Perturbation Techniques
Privacy-Preserving Collaborative Filtering using Randomized Perturbation Techniques Huseyin Polat and Wenliang Du Systems Assurance Institute Department of Electrical Engineering and Computer Science Syracuse
More informationAdditional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication
Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last
More informationCollaborative Filtering based on User Trends
Collaborative Filtering based on User Trends Panagiotis Symeonidis, Alexandros Nanopoulos, Apostolos Papadopoulos, and Yannis Manolopoulos Aristotle University, Department of Informatics, Thessalonii 54124,
More informationAn Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 1
An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 1 Bo Xie, Peng Han, Fan Yang, Ruimin Shen Department of Computer Science and Engineering, Shanghai Jiao
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationA New Search Algorithm for Solving Symmetric Traveling Salesman Problem Based on Gravity
Worl Applie Sciences Journal 16 (10): 1387-1392, 2012 ISSN 1818-4952 IDOSI Publications, 2012 A New Search Algorithm for Solving Symmetric Traveling Salesman Problem Base on Gravity Aliasghar Rahmani Hosseinabai,
More informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationRecommender System using Collaborative Filtering Methods: A Performance Evaluation
Recommender System using Collaborative Filtering Methods: A Performance Evaluation Mr. G. Suresh Assistant professor, Department of Computer Application, D. Yogeswary M.Phil.Scholar, PG and Research Department
More informationNAND flash memory is widely used as a storage
1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage
More informationA Constrained Spreading Activation Approach to Collaborative Filtering
A Constrained Spreading Activation Approach to Collaborative Filtering Josephine Griffith 1, Colm O Riordan 1, and Humphrey Sorensen 2 1 Dept. of Information Technology, National University of Ireland,
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationInfluence in Ratings-Based Recommender Systems: An Algorithm-Independent Approach
Influence in Ratings-Based Recommender Systems: An Algorithm-Independent Approach Al Mamunur Rashid George Karypis John Riedl Abstract Recommender systems have been shown to help users find items of interest
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationEvolutionary Optimisation Methods for Template Based Image Registration
Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South
More informationamount of available information and the number of visitors to Web sites in recent years
Collaboration Filtering using K-Mean Algorithm Smrity Gupta Smrity_0501@yahoo.co.in Department of computer Science and Engineering University of RAJIV GANDHI PROUDYOGIKI SHWAVIDYALAYA, BHOPAL Abstract:
More informationFuzzy Clustering in Parallel Universes
Fuzzy Clustering in Parallel Universes Bern Wisweel an Michael R. Berthol ALTANA-Chair for Bioinformatics an Information Mining Department of Computer an Information Science, University of Konstanz 78457
More informationProblem Paper Atoms Tree. atoms.pas. atoms.cpp. atoms.c. atoms.java. Time limit per test 1 second 1 second 2 seconds. Number of tests
! " # %$ & Overview Problem Paper Atoms Tree Shen Tian Harry Wiggins Carl Hultquist Program name paper.exe atoms.exe tree.exe Source name paper.pas atoms.pas tree.pas paper.cpp atoms.cpp tree.cpp paper.c
More informationSlope One Predictors for Online Rating-Based Collaborative Filtering
Slope One Predictors for Online Rating-Based Collaborative Filtering Daniel Lemire Anna Maclachlan February 7, 2005 Abstract Rating-based collaborative filtering is the process of predicting how a user
More informationA Cost Model For Nearest Neighbor Search. High-Dimensional Data Space
A Cost Moel For Nearest Neighbor Search in High-Dimensional Data Space Stefan Berchtol University of Munich Germany berchtol@informatikuni-muenchene Daniel A Keim University of Munich Germany keim@informatikuni-muenchene
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationA Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition
ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural
More informationPairwise alignment using shortest path algorithms, Gunnar Klau, November 29, 2005, 11:
airwise alignment using shortest path algorithms, Gunnar Klau, November 9,, : 3 3 airwise alignment using shortest path algorithms e will iscuss: it graph Dijkstra s algorithm algorithm (GDU) 3. References
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing
More informationEFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra
th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationOptimal Oblivious Path Selection on the Mesh
Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract
More informationConsidering bounds for approximation of 2 M to 3 N
Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for
More informationSolving the Sparsity Problem in Recommender Systems Using Association Retrieval
1896 JOURNAL OF COMPUTERS, VOL. 6, NO. 9, SEPTEMBER 211 Solving the Sparsity Problem in Recommender Systems Using Association Retrieval YiBo Chen Computer school of Wuhan University, Wuhan, Hubei, China
More informationDual Arm Robot Research Report
Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationA fast embedded selection approach for color texture classification using degraded LBP
A fast embee selection approach for color texture classification using egrae A. Porebski, N. Vanenbroucke an D. Hama Laboratoire LISIC - EA 4491 - Université u Littoral Côte Opale - 50, rue Ferinan Buisson
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationVariable Independence and Resolution Paths for Quantified Boolean Formulas
Variable Inepenence an Resolution Paths for Quantifie Boolean Formulas Allen Van Geler http://www.cse.ucsc.eu/ avg University of California, Santa Cruz Abstract. Variable inepenence in quantifie boolean
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationIndexing the Edges A simple and yet efficient approach to high-dimensional indexing
Inexing the Eges A simple an yet efficient approach to high-imensional inexing Beng Chin Ooi Kian-Lee Tan Cui Yu Stephane Bressan Department of Computer Science National University of Singapore 3 Science
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.eu 6.854J / 18.415J Avance Algorithms Fall 2008 For inormation about citing these materials or our Terms o Use, visit: http://ocw.mit.eu/terms. 18.415/6.854 Avance Algorithms
More informationComparing State-of-the-Art Collaborative Filtering Systems
Comparing State-of-the-Art Collaborative Filtering Systems Laurent Candillier, Frank Meyer, Marc Boullé France Telecom R&D Lannion, France lcandillier@hotmail.com Abstract. Collaborative filtering aims
More informationThe Journal of Systems and Software
The Journal of Systems an Software 83 (010) 1864 187 Contents lists available at ScienceDirect The Journal of Systems an Software journal homepage: www.elsevier.com/locate/jss Embeing capacity raising
More informationImproving Web Search Ranking by Incorporating User Behavior Information
Improving Web Search Ranking by Incorporating User Behavior Information Eugene Agichtein Microsoft Research eugeneag@microsoft.com Eric Brill Microsoft Research brill@microsoft.com Susan Dumais Microsoft
More informationCollaborative Filtering: A Comparison of Graph-Based Semi-Supervised Learning Methods and Memory-Based Methods
70 Computer Science 8 Collaborative Filtering: A Comparison of Graph-Based Semi-Supervised Learning Methods and Memory-Based Methods Rasna R. Walia Collaborative filtering is a method of making predictions
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationReconstructing the Nonlinear Filter Function of LILI-128 Stream Cipher Based on Complexity
Reconstructing the Nonlinear Filter Function of LILI-128 Stream Cipher Base on Complexity Xiangao Huang 1 Wei Huang 2 Xiaozhou Liu 3 Chao Wang 4 Zhu jing Wang 5 Tao Wang 1 1 College of Engineering, Shantou
More informationLab work #8. Congestion control
TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño
More informationApplying a linguistic operator for aggregating movie preferences
Applying a linguistic operator for aggregating movie preferences Ioannis Patiniotakis (1, Dimitris Apostolou (, and Gregoris Mentzas (1 (1 National Technical Univ. of Athens, Zografou 157 80, Athens Greece
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationPerformance Modelling of Necklace Hypercubes
erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract
More informationA Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
272 INFORMS Journal on Computing 0899-1499 100 1204-0272 $05.00 Vol. 12, No. 4, Fall 2000 2000 INFORMS A Revise Simplex Search Proceure for Stochastic Simulation Response Surface Optimization DAVID G.
More informationNearest Neighbor Search using Additive Binary Tree
Nearest Neighbor Search using Aitive Binary Tree Sung-Hyuk Cha an Sargur N. Srihari Center of Excellence for Document Analysis an Recognition State University of New York at Buffalo, U. S. A. E-mail: fscha,sriharig@cear.buffalo.eu
More informationarxiv: v1 [cs.ir] 1 Jul 2016
Memory Based Collaborative Filtering with Lucene arxiv:1607.00223v1 [cs.ir] 1 Jul 2016 Claudio Gennaro claudio.gennaro@isti.cnr.it ISTI-CNR, Pisa, Italy January 8, 2018 Abstract Memory Based Collaborative
More informationExploring Context with Deep Structured models for Semantic Segmentation
1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en Hengel, Ian Rei between an image patch an a large backgroun image region. Explicitly moeling
More informationImproving Performance of Sparse Matrix-Vector Multiplication
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science an Center of Simulation of Avance Rockets University of Illinois at Urbana-Champaign
More information