Your Neighbors Affect Your Ratings: On Geographical Neighborhood Influence to Rating Prediction

Size: px
Start display at page:

Download "Your Neighbors Affect Your Ratings: On Geographical Neighborhood Influence to Rating Prediction"

Transcription

1 Your Neghbors Affect Your Ratngs: On Geographcal Neghborhood Influence to Ratng Predcton Longke Hu Axn Sun Yong Lu School of Computer Engneerng, Nanyang Technologcal Unversty, Sngapore ABSTRACT Ratng predcton s to predct the preference ratng of a user to an tem that she has not rated before. Usng the busness revew data from Yelp, n ths paper, we study busness ratng predcton. A busness here can be a restaurant, a shoppng mall or other knd of busnesses. Dfferent from most other types of tems that have been studed n varous recommender systems (e.g., move, song, book), a busness physcally exsts at a geographcal locaton, and most busnesses have geographcal neghbors wthn walkng dstance. When a user vsts a busness, there s a good chance that she walks by ts neghbors. Through data analyss, we observe that there exsts weak postve correlaton between a busness s ratngs and ts neghbors ratngs, regardless of the categores of busnesses. Based on ths observaton, we assume that a user s ratng to a busness s determned by both the ntrnsc characterstcs of the busness and the extrnsc characterstcs of ts geographcal neghbors. Usng the wdely adopted latent factor model for ratng predcton, n our proposed soluton, we use two knds of latent factors to model a busness: one for ts ntrnsc characterstcs and the other for ts extrnsc characterstcs. The latter encodes the neghborhood nfluence of ths busness to ts geographcal neghbors. In our experments, we show that by ncorporatng geographcal neghborhood nfluences, much lower predcton error s acheved than the state-of-the-art models ncludng Based MF, SVD++, and Socal MF. The predcton error s further reduced by ncorporatng nfluences from busness category and revew content. Categores and Subject Descrptors H.3.3 [Informaton Systems]: Informaton Search and Retreval Informaton Flterng Keywords Recommendaton; Ratng predcton; Matrx factorzaton; Yelp 1. INTRODUCTION Recommender systems have attracted sgnfcant attenton from both academa and ndustry snce the last decade. Varous recom- Permsson to make dgtal or hard copes of all or part of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. Copyrghts for components of ths work owned by others than the author(s) must be honored. Abstractng wth credt s permtted. To copy otherwse, or republsh, to post on servers or to redstrbute to lsts, requres pror specfc permsson and/or a fee. Request permssons from permssons@acm.org. SIGIR 14, July 6 11, 014, Gold Coast, Queensland, Australa. Copyrght s held by the owner/author(s). Publcaton rghts lcensed to ACM. ACM /14/07...$ mender systems have been developed to facltate the matchng between consumers (.e., users) wth approprate products or servces (.e., tems). Example tems nclude songs, moves from content provders as well as books from E-commerce webstes. Recently, recommender systems have also been appled to socal network platforms (e.g., Facebook, Twtter, Lnkedn) for people recommendaton, e.g., recommendng frends to a user or recommendng who to follow. The prevalence of GPS-enabled devces (e.g., smart phones) n the past few years further extends the landscape of recommender systems n locaton-based socal networks (LBSN), exemplfed by Foursquare and Gowalla. Dependng on the applcaton, dfferent recommendaton problems have been defned and studed. The top-n tem recommendaton and ratng predcton are two most wdely studed categores of recommendaton problems. On the one hand, top-n tem recommendaton tasks am to recommend a user a lst of tems that she may be nterested n. For example, n LBSN, POI recommendaton ams to recommend unvsted POIs to users. Here POI stands for pont-of-nterest, referrng to a focused geographc entty such as dstrct and street, or a specfc pont locaton such as landmarks and restaurants [0]. Ratng predcton, on the other hand, s to predct the preference ratng of a user to a product or servce that she has not rated before. The products or servces wth hgh predcted ratngs are recommended to users. In ths study, we are nterested n the busness ratng predcton problem wth busness revew data from Yelp. Yelp s a busness revew ste and has attracted 47 mllon revews to local busnesses snce 004. Example busnesses n Yelp nclude restaurants, shoppng malls, beauty & spas, etc.. The webste reports that t had an average of approxmately 117 mllon monthly unque vstors n the thrd quarter of A Yelp user or Yelper can share her experence wth a busness by postng a revew of the busness and also a ratng from 1 to 5 stars. Our task s therefore to predct how many stars a user would gve to a busness that she has yet revewed. At frst glance, ratng predcton of busness s the same as predcton of user s ratng to any other knd of tems (e.g., a song or a move), wth the only dfference that the tem here refers to a busness. The key dfference, between a busness and other knd of tems that have been studed n lterature, s that a busness physcally exsts at a specfc geo-locaton wth lattude/longtude coordnates. More mportantly, most busnesses (e.g., restaurants and shops) are not geographcally solated from others. That s, when a user vsts a busness, there s a good chance that she walks by ts neghbors f they are located wthn walkng dstance. The overall envronment of that regon mght affect a user s vew about a busness and subsequently affect user s revew and ratng to the 1

2 busness. For example, the hygene standard of a regon mght affect user s ratng to many restaurants located n that regon. On the other hand, a regon dstngushes tself from other regons and becomes attractve to vstors often because there are a few good busnesses co-located n the regon. For busness ratng predcton, an nterestng queston here s: Is there any correlaton between a busness s ratng and the ratng of ts geographcal neghbors? To answer the queston above, we conducted data analyss on Yelp s busness ratng data. We observe that there does exst weak postve correlaton between the ratng of a busness and the ratng of ts neghbors, regardless of the category of the busness. Based on ths observaton, we ncorporate geographcal neghborhood nfluence nto our busness ratng predcton model whch s based on the wdely adopted latent factor model realzed by Matrx Factorzaton (MF). Together wth nfluences from other factors ncludng user revews, busness category, and busness popularty, we show that the proposed model outperforms state-of-the-art baselnes ncludng Based MF, SVD++ and Socal MF [1, 17], measured by both Mean Absolute Error (MAE) and Root Mean Square Error (RMSE). To the best of our knowledge, ths s the frst study explotng geographcal neghborhood nfluence n busness ratng predcton. We note that geographcal nfluence has been consdered n POI recommendaton and POI predcton. However, we argue that both POI recommendaton and POI predcton are dfferent research problems from busness ratng predcton (see Secton for more detals). To summarze, the man contrbutons arse from ths study are as follows: We conduct data analyss and observe that there exsts weak postve correlaton between a busness s average ratng and the average ratng of ts neghbors, regardless of the categores of busnesses. Ths s an mportant observaton that could be useful for not only busness ratng predcton, but also related studes, e.g., POI recommendaton and sentment analyss of busness revews. We drectly model the nfluence of geographcal neghborhood nto busness ratng predcton usng matrx factorzaton. Specfcally, for each busness, we use two dfferent latent factors to represent ts ntrnsc and extrnsc characterstcs respectvely. The nfluences from geographcal neghbors of a busness are then modeled as the lnear combnaton of the latent factors for the extrnsc characterstcs of ts neghbors. In our recommender system, we have also consdered other factors ncludng busness s revew, category, and popularty. To the best of our knowledge, ths s the frst study that models geographcal neghborhood nfluence nto busness ratng predcton. We conducted extensve experments to evaluate the effectveness of ncorporatng nfluence of geographcal neghborhood and other factors n busness ratng predcton and compared the predcton accuracy of the proposed model wth an array of strong baselne models. We further show that the geographcal dstance between a user and a busness adversely affects busness ratng predcton, although ths s an mportant and effectve factor n POI recommendaton problems. The rest of ths paper s organzed as follows. We revew the related work on ratng predcton, POI recommendaton and POI predcton n Secton. The data analyss s reported n Secton 3. The detals of the proposed busness ratng predcton model s presented n Secton 4, followed by expermental evaluaton n Secton 5. Fnally, Secton 6 concludes ths paper.. RELATED WORK In ths secton, we brefly revew the recent advances n recommender systems, manly focusng on the applcatons of collaboratve flterng on ratng predcton. As one of the major contrbutons of ths study s the nfluence of geographcal neghborhood, we also revew the related work employng geographcal nfluence for POI recommendaton and POI predcton. We then hghlght the major dfferences between our research problem and these two problems..1 Collaboratve Flterng Collaboratve flterng (CF) s the most wdely used technque n recommender systems [11, 1, 18, 19]. The underlyng assumpton of CF s that smlar users would rate tems smlarly or smlar tems would receve smlar ratngs from users. Ratngs here ndcate users preferences to tems. There are manly two knds of approaches, namely, memory-based CF and model-based CF. The basc dea of memory-based CF s to fnd smlar users or tems by usng smlarty measures,.e., user-based CF [1, 10] and tem-based CF [8, 1]. The commonly used smlarty measures are Pearson s correlaton and cosne smlarty, computed based on user-tem ratngs as well as other user-/tem-specfc features dependng on the applcaton. The smlar users or tems are also known as neghbors and therefore memory-based CF s also known as neghborhood-based CF. However neghbor n ths context s defned by the chosen smlarty measure. Dfferent smlarty measures lead to dfferent sets of neghbors for a gven user or tem. In ths paper, the neghborhood of a specfc busness refer to the busnesses that are located physcally close to t,.e., geographcal neghborhood. Model-based CF usually employs machne learnng technques to buld models from the observed user-tem ratngs, and then to predct the unobserved ratngs. Latent factor model s one of the most successful CF models, n whch users and tems are jontly mapped nto a shared latent space of much lower dmensonalty. As the most successful realzaton of latent factor model, matrx factorzaton (MF) [1,14,17] has been successfully appled to varous recommender systems ncludng musc ratng predcton for Yahoo! Musc [11] and Last.fm [4], move ratng predcton for Netflx [1, 13] and Douban [17, 4], and personalzed tweet recommendaton []. Among varous MF models proposed, SVD++ [1] s probably one of the most successful models. Ths model ntegrates the mplct feedback nformaton from a user to tems (e.g., based on user s purchase hstory or browsng hstory). More specfcally, the user vector of latent factors n ths model s complemented by the latent factors of the tems to whch the user has provded mplct feedback. Recently, Ma [17] proposed a socal regularzaton MF method, named Socal MF, to employ the smlar and dssmlar relatonshps between users and/or tems to mprove recommendaton accuracy. The smlarty between tems s measured based on ther ratngs usng Pearson s correlaton or cosne smlarty. In our experments, the proposed models acheve better ratng predcton accuracy than Socal MF ndcatng that the nfluence from geographcal neghborhood s more effectve than the nfluence from neghbors chosen by ratng-based smlarty measures. Based on MF, nfluence from other aspects of users or tems besdes the ratngs can be flexbly and easly modeled. For example, Koengsten et al. [11] ncorporated rch tem bas nto MF model to capture the taxonomy nformaton of musc. Each musc has multple types of nformaton such as track, album, artst and genre. In ther proposed model, MF was extended by addng shared bas parameters for tems lnked by common taxonomy. Moreover, some other work has also shown that popularty s helpful n mprovng

3 the recommendaton accuracy [7, ]. To capture users nterests over tweet content, Chen et al. [] proposed to use topc-level latent factors. Instead of drectly askng whether a user s nterested n a tweet, the model captures user s preference over the words n the tweet. In our problem settng, we consder the revew from a user further elaborates about the ratng. We model the words n revew as latent factors and ncorporate the revew nto ratng predcton.. POI Recommendaton and Predcton POI recommendaton has attracted sgnfcant attenton recently wth the popularty of LBSN [3, 6, 5, 6]. Because geographcal neghborhood s the man focus n our study, there s a need to revew recent advances n POI recommendaton. The man research ssue n POI recommendaton s to accurately recommend unvsted POIs to users. Geographcal nfluence and temporal nfluence are major consderatons n POI recommendaton [5, 6]. Geographcal nfluence s based on the observaton that users tend to vst nearby POIs of ther home or offce locatons, as well as nearby locatons of the POIs n ther favor. Temporal nfluence s reflected by the observaton that users check-n dfferent types of POIs at dfferent tme slots of a day (e.g., restaurant n lunch hour and bar n nght). Moreover, POI recommendaton has also consdered socal nfluence among frends [5]. POI predcton ams to predct whch POI a user would vst next gven her current locaton and tme [4, 6]. Dfferent from POI recommendaton, the POI predcted for a user to be vsted next may have been vsted by the user before. Smlarly, both geographcal nfluence and temporal nfluence have been consdered n the modelng. Lu et al. [16] proposed a category-aware POI predcton model by explotng users preference transton over locaton categores. In ths model, MF s utlzed to predct a user s preference transtons over categores and then the locatons n the correspondng categores by consderng geographcal nfluences. The model was evaluated on Gowalla check-n data wth three-level category herarchy. In our model, we also consder category nformaton of the busness. However, we drectly ncorporate category latent factors nto our factorzaton model to reflect the affnty of busnesses lnked by the categores they belong to. Note that, categores n the Yelp dataset are not organzed n herarchy. In ths paper, we study the mpact of geographcal neghborhood nfluence to busness ratng predcton. We argue that the geographcal neghborhood nfluence n our research problem s essentally dfferent from the geographcal nfluence n POI recommendaton and/or predcton. For POI recommendaton/predcton, the geographcal nfluence s more related to the cost of travel (e.g., tme cost or monetary cost) from a user s pont of vew. For ratng predcton, on the other hand, we predct a user s degree of preference to a yet revewed busness. The cost of travel here s expected to be a less mportant factor. The contextual factors (e.g., the current locaton, the tme of vstng) whch have demonstrated effectve n POI recommendaton/predcton are also less relevant to our research problem. In our research problem, geographcal neghborhood nfluence s more related to the busness envronment created by the surroundng busnesses to one busness at a specfc locaton. Next, we conduct data analyss of the Yelp data. 3. DATA ANALYSIS 3.1 Dataset Our study s based on the recently released Yelp Dataset Challenge. The data s sampled by Yelp from the greater Phoenx, AZ Table 1: Number of revews/ratngs per user/busness Statstcs User Busness Mnmum number of revews/ratngs 1 3 Maxmum number of revews/ratngs Average number of revews/ratngs Percentage neghbor 3 neghbors 6 neghbors 10 neghbors Dstance threshold (meter) Fgure 1: Percentage of busnesses havng at least 1, 3, 6, 10 neghbors wthn a dstance threshold from 0 to 000 meters metropoltan area from March 005 to January 013. It contans 11,537 busnesses, 9,907 revews by 43,873 users, and 8,8 check-n sets. Ths dataset was used as tranng data n ACM Rec- Sys Challenge A busness has a unque d, name, address, lattude longtude, ts categores and some other attrbutes lke cty, state, and neghborhoods. However, we observe that the neghborhoods attrbute s empty n the dataset. A revew contans busness d, user d, ratng from 1 to 5 stars, date, revew text, and votng. In ths study, we do not use the votng feature for ts less relevance to our research problem. Table 1 reports the mnmum, maxmum, and average number of ratngs per user and per busness respectvely. A check-n set for a busness contans the aggregated number of check-ns n every hour from Monday to Sunday. The largest number of check-ns to one busness observed from the data s,977. Note that, the dataset does not provde detaled check-n records of whch user checkn a busness at what tme, and there are only about 7% of busnesses have check-n sets. The percentage becomes 85.13% among all busnesses havng at least 5 revews. In other words, a busness may have a number of revews but no check-n records. The dataset does not provde much detals of a user. 3. Observatons Tobler s Frst Law of Geography states Everythng s related to everythng else, but near thngs are more related than dstant thngs [3]. Next, we present 3 observatons made from the data wth respect to geographcal neghborhood. Observaton 1. Most busnesses have neghbors wthn a short geographcal dstance from ther locatons. More than 44% of busnesses have one neghbor next to t wthn 0 meters and 95% of busnesses have one neghbor wthn 500 meters. Based on the busness lattudes and longtudes, we calculate the geographcal dstance between two busnesses usng Haversne formula.4 Fgure 1 plots the percentage of busnesses havng at least 1, 3, 6, and 10 neghbors respectvely, wthn a geographcal dstance threshold rangng from 0 to 000 meters. It shows that most busnesses are not solated geographcally from others. Specfcally,

4 Correlaton coeffcent NN 3NN 6NN 10NN Random Dstance threshold (meter) Num. of busnesses (logscale) Category d by number of busnesses n descendng order Fgure : Pearson s correlaton between a busness s ratng and the average ratng of ts {1, 3, 6, 10} nearest neghbors (NN), wthn a dstance threshold. 44.3% of busnesses have one neghbor next to t wthn 0 meters. The percentage rses to 95.6% f the dstance threshold s set to 500 meters, a dstance for a 6-mnute walk.5 Wthn ths walkng dstance, about 80% of busnesses have at least 6 neghbors, and 66% have at least 10 neghbors. Observaton. The average ratng of a busness s weakly postvely correlated wth the average ratng of ts neghbors. Before explorng a new place, we often receve advce on whch regon s famous for good food (e.g., a few famous restaurants collocatng n that regon), or advce on whch regon to avod for shoppng because the shops there are nfamous for cheatng. Ths phenomenon of thngs of one knd come together s also reflected from the postve correlaton between the ratngs of busnesses and ther geographcal neghbors. We calculate the average ratng of a busness from all ts user revews. Hereafter, for easy presentaton, we refer ths average ratng smply as the ratng of a busness or a busness s ratng when the context s clear. Fgure plots the Pearson s correlaton coeffcent between a busness s ratng and the average ratng of ts 1, 3, 6, and 10 nearest neghbors, at dfferent dstance thresholds from 0 to 000 meters. For a gven dstance threshold, f a busness has no neghbors wthn the dstance, then ths busness s excluded from the computaton. If a busness has fewer than the number of nearest neghbors specfed (e.g., 10NN) wthn the dstance threshold, then the ratngs of all ts nearest neghbors wthn the dstance threshold are averaged. For reference, for each busness partcpated n the computaton wthn a dstance threshold, we also randomly sample a busness from the dataset (regardless of the dstance between the two) and then compute the Pearson s correlaton between the two sets of ratngs, labeled Random n the plot. From Fgure, we observe that the ratng of a busness s weakly postvely correlated wth the average ratng of ts nearest neghbor(s). Pearson s correlaton coeffcent s n the range of to The correlaton s relatvely stronger wthn a smaller dstance (e.g., 0 or 50 meters) and becomes stable for dstance threshold of 500 meters or larger. In comparson, correlaton coeffcent between the ratngs of the same set of busnesses and ther randomly selected counterparts s n the range of to 0.00,.e., no correlaton, as expected. We have two nterpretatons of the weak postve correlaton between ratngs of busnesses and ther neghbors. Frst, the ratng of a busness should manly depend on the ntrnsc characterstcs 5 Human preferred walkng speed s about 1.4 m/s or 5km/h. Fgure 3: Busness category dstrbuton of the busness (e.g., qualty of products/servces), not ts neghbors. Second, a busness s not geographcally ndependent from ts neghbors. When a user vsts one busness, she has at least glanced over ts neghbors f not vsted them. These neghbors gve her the sense of the surroundng envronment of the busness (e.g., hygene standard). Such extrnsc characterstcs may affect her vew of the busness, leadng to the weak postve correlaton. Based on the weak postve correlaton, we expect more accurate busness ratng predcton can be acheved by consderng the nfluence of the geographcal neghbors of a busness. Observaton 3. The weak postve correlaton n ratngs s ndependent of the categores of the busnesses and/or ther neghbors. A busness n Yelp s assgned one or more category labels (e.g., restaurant, shoppng). Plotted n Fgure 3, the number of busnesses n categores demonstrate a power-law lke dstrbuton, wth a few categores each contanng a large number of busnesses and many small categores each has only one or two busnesses. Restaurants, the largest category, covers nearly 40% of the 11,537 busnesses n the dataset. Next, we study the 5 largest categores as representatve examples. They are: Restaurants (4, 503), Shoppng (1, 681), Food (1,616), Beauty & Spas (764), and Nghtlfe (640), where the numbers n parentheses ndcate the number of busnesses n each category. For each of the 5 categores, we calculate the ratng correlaton between the busnesses n the category and ther neghbors, regardless of the categores of ther neghbors because the neghbors here are defned geographcally. The category-wse ratng correlatons wth 1NN and 6NN are plotted n Fgures 4(a) and 4(b) respectvely. The lnes labeled random, plotted for reference purpose, report the correlaton between the ratngs of busnesses n any of the 5 categores and randomly selected busnesses from the dataset (regardless of ther categores and geographcal dstance). Shown n Fgure 4(a), busnesses n Beauty & Spas demonstrate slghtly stronger ratng correlaton wth ther 1NN compared wth busnesses n Nghtlfe and Shoppng. When the number of nearest neghbors s enlarged to 6, ths pattern becomes less apparent, partcularly when the dstance threshold reaches 500 meters, plotted n Fgure 4(b). In both Fgures 4(a) and 4(b), weak postve correlaton s observed for ratngs of busnesses n all 5 categores across all dstance thresholds.6 Fgures 4(c) and 4(d) show the percentage of the nearest neghbors that are also n the same category. The two fgures show very smlar patterns: () Restaurants are more lkely collocated wth restaurants wth about 50% chance that the neghbors of a restaurant are also restaurants; () Beauty & Spas on the other 6 Smlar observaton also holds for 3NN and 10NN. The fgures are not plotted due to page lmt.

5 Correlaton coeffcent Restaurants Shoppng Food Beauty & Spas Nghtlfe Random Correlaton coeffcent Restaurants Shoppng Food Beauty & Spas Nghtlfe Random Dstance threshold of the 1NN (meter) (a) Ratng correlaton of 1NN Dstance threshold of 6NN (meter) (b) Ratng correlaton of 6NN Percentage n same category Restaurants Shoppng Food Beauty & Spas Nghtlfe 0 Dstance threshold of 1NN (meter) (c) Percentage of 1NN beng n the same category Percentage n same category Restaurants Shoppng Food Beauty & Spas Nghtlfe 0 Dstance threshold of 6NN (meter) (d) Percentage of 6NN beng n the same category Fgure 4: Category-wse ratng correlaton wth nearest neghbors (1NN, 6NN), and the percentage of neghbors n the same category hand s much more dstnctve from ther neghbors. Below 0% of ther neghbors are also n the same category. Wth respect to Fgures 4(a) and 4(b), we argue that weak postve ratng correlaton between busnesses and ther neghbors s ndependent of whether the neghbors are n the same category. In summary, the three observatons made from the data suggest that geographcal neghborhood has nfluences on the ratng of a busness. Next, we ncorporate geographcal neghborhood nfluence nto busness ratng predcton. 4. BUSINESS RATING PREDICTION The problem of ratng predcton has been well formulated n lterature. We use r u to denote the revew ratng that user u gves to tem (.e., a busness). r u s n the range of 1 to 5 stars wth more stars ndcatng hgher preference. Gven the exstng ratngs made by m users to n tems, the task s to predct the unknown ratng ˆr u, f user u has not rated tem before. In the followng, we frst brefly ntroduce matrx factorzaton and then present our proposed model by ncorporatng varous nfluences nto the predcton. Table lsts the notatons used n ths paper. 4.1 Matrx Factorzaton Our proposed method s based on the latent factor model realzed by matrx factorzaton. Through matrx factorzaton, each user and each tem s assocated wth a f -dmensonal vector, where f mn(m,n). The nner product of a user vector p u R f 1 and an tem vector q R f 1 s used to approxmate the user s preference to the tem (see [13] for a detaled ntroducton of matrx factorzaton). Accordngly, the predcted ratng of user u to tem s computed usng ˆr u = p u q, where p u and q can be learned from the user-tem ratng matrx wth known ratngs. However, users may have certan degree of b- Table : Notatons and semantcs N Set of geographcal neghbors of tem C Set of categores tem belongs to R Set of words n tem s revew K Set of (u,) pars wth known r u ratngs r u, ˆr u Observed and predcted ratngs of user u to tem µ Mean of all known r u ratngs b u, b Bas parameters for user u and tem, respectvely p u Latent factors of user u q Latent factors of tem for ts ntrnsc characterstcs v Latent factors of tem for ts extrnsc characterstcs d c Latent factors of category c q w Latent factors of revew word w ρ Normalzed popularty of tem β Popularty weghtng parameter for tem τ u, Normalzed geo-dstance between user u and tem β u Geo-dstance weghtng parameter for user u ases: some users are more lenent and some are very strct about ratngs. Smlarly, tems may also have some degree of bases because of locaton or brandng for example. To acheve more accurate ratng predcton, Based MF extends the basc matrx factorzaton by consderng the bases, ˆr u = µ + b u + b + p u q, (1) where µ s the average ratng of all known ratngs; b u and b are the user bas and tem bas, respectvely. Learnng the unknown parameters p u, q, b u, and b s an optmzaton problem to mnmze the regularzed squared error on the set of known ratngs K. mn (r u ˆr u ) ( + λ 1 pu + q ) ( + λ b u + b ) p,q,b (u,) K

6 In ths equaton, λ 1 and λ are regularzaton parameters used to avod overfttng. Both stochastc gradent descent (SGD) and alternatng least squares (ALS) algorthms can be used to solve the optmzaton functon and learn the parameters [1, 13]. In ths paper, we adopt SGD to learn the parameters followng the algorthm presented n [1]. 4. Incorporatng Neghborhood Influence Based on our observatons n Secton 3., most busnesses have neghbors wthn a short geographcal dstance, and more mportantly, the ratng of a busness s weakly postvely correlated wth the ratng of ts neghbors. These observatons suggest that consderng the geographcal neghborhood nfluence may mprove the accuracy of busness ratng predcton. In ths paper, to model users ratng behavor on busnesses, we frst assume that a user s ratng to a gven busness s determned by ts ntrnsc characterstcs and the extrnsc characterstcs of ts geographcal neghbors. For a busness, we use q and v to model ts ntrnsc and extrnsc characterstcs, respectvely. More specfcally, q models the ntrnsc characterstcs of a busness (e.g., taste of food and qualty of servce) observable by users who have nteracted wth the busness. v models the extrnsc characterstcs of a busness (e.g., hygene standard) n nfluencng ts geographcal neghbors observable by the pass-by vstors. Let N be the set of geographcal neghbors of a busness, satsfyng certan selecton crtera (e.g., the top-6 nearest neghbors). Let n N be a neghbor of busness. Incorporated wth nfluence from geographcal neghbors, the predcted ratng s now computed wth both q and v n s, shown n Equaton. ˆr u = µ + b u + b + p u q + α 1 N n N v n In above equaton, parameter α 1 [0,1] controls the mportance of geographcal neghborhood nfluence n busness ratng predcton, denotes the cardnalty of a set. Accordngly, the objectve functon s updated wth regularzaton components for v n, shown n Equaton 6 n Table 3, where λ 3 s the newly ntroduced regularzaton parameter, smlar to λ 1 and λ. Note that, by consderng v n s n the predcton, Equaton partally addresses the cold-start problem for newly establshed busnesses that do not appear n tranng data. Although q of a new busness s empty, the v n s of ts geographcal neghbors are not empty f they appear n tranng data. Therefore Equaton can be appled to make ratng predcton of an exstng user to a newly establshed busness by usng p u, b u and v n s. () 4.3 Incorporatng Category Influence Analyzed n Secton 3., a busness n Yelp may belong to one or more categores. The category of a busness usually reflects the characterstcs of a busness, e.g., product/servce offered by the busness or the way the busness s conducted. Intutvely, users may use dfferent crtera to evaluate busnesses n dfferent categores. For example, the crtera commonly used for revewng restaurant (e.g., taste of food) cannot be used to revew busnesses n beauty & spas category. Moreover, a recent study has also shown that POI recommendaton acheves better accuracy by consderng the categores of the POIs [16]. In our model, we ntroduce category latent factors to explot busness categores for more accurate busness ratng predcton. For a busness category c, t s assocated wth a latent vector d c R f 1. Let C be the set of categores a busness belongs to. By ncorporatng the category nfluence, the predcted ratng ˆr u s now defned n Equaton 3, where α [0,1] s a parameter that controls the mportance of category nfluence n ratng predcton. The objectve functon s updated accordngly, see Equaton 7 n Table 3. ˆr u = µ + b u + b + p u q + α 1 N v n + α C n N c C d c 4.4 Incorporatng Revew Content In Yelp, when gvng a ratng to a busness from 1 to 5 stars, the user usually wrtes a revew. Typcally, the revew elaborates the reason behnd the ratng and partally reflects the characterstcs of the busness. Collectvely, words n all revews to a busness provde a much better descrpton about the busness than the learned vector of latent factors. However, n order to make use of the revew words n the predcton model, the revew words have to be mapped to the same f -dmensonal vector space. Smlar to the topc level decomposton of tweets for tweet recommendaton n [], we decompose the latent factors of a busness q nto a combnaton of latent factors of revew words. Let R be the set of words that appear n busness s revew, the decomposton s shown as follows, where q w denotes the latent factors of word w. q 1 R (3) w R q w (4) Wth the decomposton, the predcted ratng s now shown n Equaton 5. The objectve functon s shown n Equaton 8 n Table 3. ˆr u = µ + b u + b + p 1 u R q w + α 1 N w R v n + α C n N c C d c 4.5 Popularty and Geo-dstance Influences Next, we dscuss two features that have been studed n POI recommendaton, namely popularty and geographcal dstance. In Secton 1, we argue that the key dfference between a busness wth other knd of tems that have been studed n ratng predcton s that a busness physcally exsts at a geographcal locaton. Although we argue that busness ratng predcton s dfferent from POI recommendaton, t remans nterestng to nvestgate whether the features explored n POI recommendaton are useful here. Regonal popularty s mentoned as one of the unque characterstcs n LBSNs whch dstngush POI recommendaton from other recommendaton tasks [15]. For example, busnesses located n downtown area are lkely to receve more vsts than those n suburban. In the Yelp dataset, a busness has check-n sets and revews, both are ndcators of busness popularty. Note that, a user may wrte one revew to a busness but may check-n at the busness multple tmes. However, the Yelp dataset only provdes the aggregated check-n numbers on hourly bass from Monday to Sunday but not user-specfc check-ns. Some of the busnesses n the dataset do not have check-n sets. We therefore smply sum up the number of revews and the number of check-ns of a busness to be ts popularty. In POI recommendaton, geographcal dstance s a major consderaton because users tend to vst nearby POIs [5, 6]. Wth users revew data, we estmate a user s home locaton by usng the recursve grd search algorthm proposed n [5]. Then the geographcal dstance between a user and an unrated busness can be easly calculated based on the estmated user locaton and the locaton of the busness. (5)

7 Table 3: Objectve functons for ncorporatng neghborhood nfluence, category nfluence, revew words and other factors mn (r u ˆr u ) ( + λ 1 pu + q ) ( + λ b u + b ) p,q,b,v + λ3 v n (6) (u,) K n N mn (r u ˆr u ) ( + λ 1 pu + q ) ( + λ b u + b ) p,q,b,v,d + λ3 v n + d c (u,) K n N c C mn (r u ˆr u ) + λ 1 u p,q,b,v,d (u,) K p + q w ( + λ b u + b ) + λ3 v n + d c w R n N c C mn (r u ˆr u ) + λ 1 u p,q,b,v,d, β (u,) K p + q w ( + λ b u + b + β + u) β + λ3 v n + d c w R n N c C (7) (8) (9) For smplcty, we model both popularty and geographcal dstance as a ratng bas z. z = β ρ + β u τ u, (10) In above equaton, ρ s the normalzed popularty of tem by takng the common logarthm of ts raw popularty value; τ u, s the normalzed dstance between user u and busness by takng the common logarthm of the geographcal dstance. The two parameters β and β u are the weghtng parameters for busness and user u respectvely; both are learned from the tranng data. Wth ratng bas z, the predcted ratng s shown n Equaton 11. ˆr u = µ + b u + b + z + p 1 u R q w + α 1 N w R v n + α C n N c C d c (11) Note that, we do not replace the user bas b u and tem bas b by ratng bas z. The reason s that the ratng bas β ρ + β u τ u, captures bases specfc to popularty and geographcal dstance respectvely, whle b u and b are used to capture bas from all unknown factors. The objectve functon consderng both popularty and geographcal dstance s shown n Equaton 9 n Table EXPERIMENTS We now conduct experments on the Yelp dataset to evaluate the proposed models and compare the proposed models wth state-ofthe-art baselnes. 5.1 Expermental Settng Dataset. We use the Yelp dataset that has been studed n Secton 3.1 n our experments. The preprocessng of the dataset n our experments ncludes removal of busnesses and users havng fewer than 10 revews, stop words removal and stemmng n revews. After the preprocessng, we have 113,514 ratngs by 3,965 users to 3, 760 busnesses. For each user, we sort her ratngs n chronologcal order. The frst 70% of ratngs are used for tranng, and the remanng 30% for testng. As the result, we have 79,309 ratngs to buld the matrx factorzaton model for the predcton of the remanng 34,05 ratngs. The data sparsty s 99.47%. Evaluaton Metrc. We adopt two popular evaluaton metrcs, namely, Mean Absolute Error (MAE) and Root Mean Square Error (RMSE). The smaller MAE or RMSE value means better ratng predcton accuracy. In the followng equatons, T s the set of user-tem ratng pars (u,) used n testng. 1 M AE = r u ˆr u T (u,) T 1 RMSE = (r u ˆr u ) T (u,) T Baselne Methods. We compare the proposed models wth the followng 8 baselne methods. All these baselne methods are mplemented by usng the MyMedaLte lbrary [9]. 1. Global Mean: ths method predcts an unknown ratng to be the average of all known ratngs,.e., ˆr u = µ.. User Mean: ths method utlzes the mean ratng of each user to predct the mssng values for the correspondng user. 3. Item Mean: ths method uses the mean ratng of each tem to predct the mssng values for the correspondng tem. 4. User KNN: ths method s the user-based collaboratve flterng. The unknown ratngs are predcted by consderng the ratngs gven by smlar users. User smlarty s computed by cosne smlarty of ratngs and k = 150 n our experments. We have also evaluated Pearson s correlaton as user smlarty whch gves poorer results compared wth cosne smlarty. 5. Item KNN: ths method s the tem-based collaboratve flterng. The unknown ratngs are predcted by consderng the ratngs receved by smlar tems. Item smlarty s computed by cosne smlarty of ratngs and k = Based MF: ths s the MF model wth user and tem bases brefly descrbed n Secton 4.1. Based MF s wdely used as a baselne n recommender systems. 7. SVD++: ths model consders mplct feedback from users for ratng predcton [1]. SVD++ usually offers a superor accuracy and s consdered as a state-of-the-art matrx factorzaton algorthm for recommendaton. 8. Socal MF: ths model consders mplct socal nformaton between tems and/or users. The mplct socal nformaton can be derved from most smlar and dssmlar users/tems usng Pearson s correlatons or cosne smlarty of ratngs. As our model consders nfluences from nearest geographcal neghbors, for a far comparson, we nclude the mplct

8 socal nformaton from most smlar tems n Socal MF.7 Followng [17], the most smlar tems are selected by usng Pearson s correlaton of ratngs greater than Proposed Methods. We extended Based MF to ncorporate nfluences from multple factors: geographcal neghborhood (N), busness category (C), revew content (R), busness popularty (P), and geographcal dstance (D). The proposed methods are denoted usng the letters n parentheses to ndcate the nfluences consdered n each method. 9. N-MF: ths method ncorporates geographcal neghborhood nfluence (Secton 4., Equaton ). 10. NC-MF: ths method ncorporates both geographcal neghborhood and category nfluences (Secton 4.3, Equaton 3). 11. NCR-MF: ths model ncorporates neghborhood, category and revew content nfluences (Secton 4.4, Equaton 5). 1. NCRP-MF: ths model ncorporates neghborhood, category, revew content and popularty nfluences, by settng z = β ρ n Equaton 10 (Secton 4.5). 13. NCRPD-MF: ths model ncorporates all factors: neghborhood, category, revew content, popularty and geographcal dstance, z = β ρ + β u τ u, (Secton 4.5). We also evaluate another two methods: CRP-MF and CRPD-MF. These two methods do not ncorporate geographcal neghborhood nfluence but ncorporate nfluences from other factors (.e., C, R, P, and D) ndcated by the method names. Parameter Settng. We performed 5-fold cross-valdaton on the tranng set to emprcally set the hyperparameters. The number of latent factors f = 0; the relatve mportance of neghborhood and category nfluences are set to α 1 = 0.8, α = 0.6; The regularzaton parameters: λ 1 = 0.8, λ = 0.4, λ 3 = 0.6. The latent factors are learned by SGD wth ntal learnng rate γ = 0.008, whch decreases by a factor of 0.9 after each teraton (see Appendx A). The same parameters are used n all methods for far comparson for all our proposed methods and the baselne methods whenever applcable. For example, the number of latent factors s also set to 0 n baselne methods Based MF, SVD++ and Socal MF. For geographcal neghborhood nfluence, by default, the proposed methods use the 6 nearest neghbors for each busness. For all the methods based on matrx factorzaton, the reported results are averaged over 5 runs to avod the mpact of ntalzaton n parameter learnng. 5. Expermental Results We frst compare the proposed methods wth baselne methods and then evaluate the two schemes for defnng the set of geographcal neghbors for a busness. Lastly, we evaluate the proposed methods wth cold-start settng Method Comparson The predcton errors measured by MAE and RMSE of all methods are reported n Table 4 wth best results hghlghted n boldface. We make four observatons from the results. Frst, ncorporatng geographcal neghborhood nfluence nto busness ratng predcton greatly reduces predcton errors measured 7 Note that, our model can also be extended to nclude the other knds of mplct socal nformaton as n Socal MF. However, the man purpose of our expermental evaluaton s to evaluate the nfluence from geographcal neghbors n comparson to the nfluence from smlar tems measured by ratng-based smlarty. Table 4: MAE and RMSE of all methods, the lower the better. ID Method MAE RMSE 1 Global Mean (µ) Item Mean User Mean Item KNN User KNN Based MF SVD Socal MF N-MF NC-MF NCR-MF NCRP-MF NCRPD-MF CRP-MF CRPD-MF by both MAE and RMSE. All the proposed methods wth geographcal neghborhood nfluence (.e., methods 9-13) outperform all baselne methods (methods 1-8). The best predcton accuracy s acheved by NCRP-MF whch consders geographcal neghborhood (N), busness category (C), revew content (R), and busness popularty (P). Wth geographcal neghborhood nfluence alone, N-MF outperforms all baselnes ncludng state-of-the-art methods SVD++ and Socal MF. Ths result suggests that geographcal neghbors are more effectve than the neghbors derved from ratng-based smlarty as n Socal MF. Second, compared wth geographcal neghborhood, further consderng factors lke busness category (C), revew content (R), and busness popularty (P) leads to relatvely small addtonal reducton n predcton errors. The geographcal dstance factor (D) adversely affects busness ratng predcton accuracy. Method NCRPD- MF performs the worst among all methods wth geographcal neghborhood nfluence measured by both MAE and RMSE. Ths result suggests that the geographcal dstance factor ntroduces nose n the predcton model. Such result supports our earler dscusson that geographcal dstance between users and tems s less relevant to the problem of busness ratng predcton. Thrd, wthout ncorporatng geographcal nfluence, CRP-MF performs poorer than most methods wth geographcal neghborhood nfluence ncludng N-MF, NC-MF, NCR-MF, and NCRP- MF. The poorer performance of CRP-MF aganst N-MF suggests that the geographcal neghborhood nfluence s more effectve than the combnaton of the three factors (C, R, and P) n busness ratng predcton. The much poorer performance of CRPD-MF n comparson wth CRP-MF agan suggests the adverse effect of geographcal dstance factor (D). On the other hand, the effectveness of geographcal neghborhood nfluence s also reflected from the better performance of NCRPD-MF compared wth CRPD-MF. Last, among the 8 baselne methods, SVD++ and Socal MF, the two state-of-the-art methods, perform the best evaluated by RMSE. By MAE measure, User KNN gves surprsngly low error rate and the two methods SVD++ and Socal MF reman among the three best methods. 5.. Impact of Neghborhood Sze Gven a busness, ts geographcal neghbors can be defned based on ether a geographcal dstance threshold or the number of nearest neghbors. In ths set of experments, we evaluate the two schemes on ther mpact to the predcton error of the N-MF method. The

9 MAE MAE Dstance threshold (meter) (a) Neghbors by dstance (MAE) Nearest neghbor (b) Neghbors by neghborhood sze (MAE) RMSE RMSE Dstance threshold (meter) (c) Neghbors by dstance (RMSE) Nearest neghbor (d) Neghbors by neghborhood sze (RMSE) Fgure 5: Predcton error of N-MF wth two schemes for determnng geographcal neghbors of a busness N-MF method s selected as the method for evaluaton because t only consders the geographcal neghborhood factor. Fgures 5(a) and 5(c) respectvely plot MAE and RMSE of the N-MF method by defnng geographcal neghbors wth a dstance threshold rangng from 0 to 000 meters. Fgures 5(b) and 5(d) respectvely plot the MAE and RMSE of the method by takng the number of nearest neghbors rangng from 1 to 10. The y-axes of the two sets of fgures are plotted n the same scale for easy comparson. From the two sets of fgures, ether the dstance threshold of 1000 meters or the top-6 nearest neghbors gve the best predcton accuracy by consderng both MAE and RMSE. Plotted n Fgure 1, wth a dstance threshold of 1000 meters, more than 90% of busnesses have at least 6 neghbors and about 84% of the busnesses have at least 10 neghbors. Because some busnesses may have a large number of neghbors wthn 1000 meters, we choose to use 6 nearest neghbors manly for mnmzng computatonal cost. We have also evaluated the method by usng at most 6 nearest neghbors wthn a 1000-meter dstance threshold. However, poorer predcton accuracy was obtaned compared wth smply usng 6 nearest neghbors wthout a dstance threshold Cold-Start Busness Ratng Predcton Cold-start s a challengng ssue n any recommender systems when there s no enough nformaton about ether users or tems. We now evaluate the performance of the proposed methods n predctng ratngs by exstng users to newly establshed busnesses. Recall that n our data preprocessng (see Secton 5.1), busnesses and users wth fewer than 10 revews were removed. In ths set of experments, we try to predct the ratngs by exstng users n the tranng data to the busnesses that were removed n data preprocessng. That s, from exstng tranng data, we have the user vector of latent factors p u, but not the tem vector q because the newly establshed busnesses were not the tranng data. In total, there are 0,395 ratngs made by 3,319 exstng users to 6,939 new busnesses. Ths collecton of ratngs wll be used as test set. Among all baselne methods, Global Mean and User Mean can be easly appled. Item Mean, User KNN and Item KNN cannot be appled as we assume that the newly establshed busnesses have no Table 5: MAE and RMSE n cold-start settng Method MAE RMSE Global Mean User Mean Based MF N-MF NC-MF revews yet. Both Based MF and SVD++ are reduced to µ + b u because b and q are both unknown (see Equaton 1). Socal MF s not applcable here because t reles on smlar tems by some smlarty functons. Among the proposed methods, both the latent factors for the extrnsc characterstcs of geographcal neghbors (.e., v n s of exstng busnesses) and busness category (.e., d c ) can be utlzed n predcton. Here, we assume the category of the newly establshed busness s known (e.g., restaurant or bookstore). The predcton s made by Equaton 3 after removng b and q from the equaton. Reported n Table 5, the proposed method NC-MF acheves the best predcton accuracy by consderng both geographcal neghborhood and busness category. Utlzng geographcal nfluence alone, N-MF s the second best performng methods by both MAE and RMSE. Both User Mean and Based MF are better than Global Mean wth the former acheves better MAE and the latter acheves better RMSE. In summary, the proposed methods predct more accurate ratngs for exstng users to newly establshed busnesses n cold-start settng. 6. CONCLUSION To the best of our knowledge, ths s the frst study on geographcal neghborhood nfluence to users busness ratng behavor. We beleve the observaton that a busness s ratng s weakly postvely correlated wth ts geographcal neghbors ratng s an mportant one. Based on ths observaton, we model a busness wth two vectors of latent factors one for ts ntrnsc characterstcs and the other for ts extrnsc characterstcs (or ts nfluence to ts geographcal neghbors). In our experments, we show that by ncorporatng ge-

10 ographcal neghborhood nfluence, the proposed methods outperform state-of-the-art methods. Other factors lke busness category, popularty, and revew content can further mprove the ratng predcton accuracy. Nevertheless, the geographcal dstance between a user and a busness adversely affects the predcton accuracy, although t s an mportant factor n POI recommendaton and POI predcton. The ncorporaton of geographcal neghborhood nfluence also partally enables our methods to better handle coldstart stuaton, for ratng predcton of newly establshed busnesses based on both ther geographcal neghbors and busness categores. As a part of our future work, we are nterested n nvestgatng the nfluence of geographcal neghborhood n POI recommendaton and sentment analyss of busness revews. 7. REFERENCES [1] J. S. Breese, D. Heckerman, and C. Kade. Emprcal analyss of predctve algorthms for collaboratve flterng. In UAI, pages Morgan Kaufmann Publshers Inc., [] K. Chen, T. Chen, G. Zheng, O. Jn, E. Yao, and Y. Yu. Collaboratve personalzed tweet recommendaton. In SIGIR, pages ACM, 01. [3] C. Cheng, H. Yang, I. Kng, and M. R. Lyu. Fused matrx factorzaton wth geographcal and socal nfluence n locaton-based socal networks. In AAAI, 01. [4] C. Cheng, H. Yang, M. R. Lyu, and I. Kng. Where you lke to go next: Successve pont-of-nterest recommendaton. In IJCAI, pages AAAI Press, 013. [5] Z. Cheng, J. Caverlee, K. Lee, and D. Z. Su. Explorng mllons of footprnts n locaton sharng servces. In ICWSM, pages The AAAI Press, 011. [6] E. Cho, S. A. Myers, and J. Leskovec. Frendshp and moblty: User movement n locaton-based socal networks. In KDD, pages ACM, 011. [7] P. Cremones, Y. Koren, and R. Turrn. Performance of recommender algorthms on top-n recommendaton tasks. In RecSys, pages ACM, 010. [8] M. Deshpande and G. Karyps. Item-based top-n recommendaton algorthms. ACM Trans. Inf. Syst., (1): , 004. [9] Z. Gantner, S. Rendle, C. Freudenthaler, and L. Schmdt-Theme. MyMedaLte: A free recommender system lbrary. In RecSys, pages ACM, 011. [10] R. Jn, J. Y. Cha, and L. S. An automatc weghtng scheme for collaboratve flterng. In SIGIR, pages , 004. [11] N. Koengsten, G. Dror, and Y. Koren. Yahoo! musc recommendatons: Modelng musc ratngs wth temporal dynamcs and tem taxonomy. In RecSys, pages ACM, 011. [1] Y. Koren. Factorzaton meets the neghborhood: A multfaceted collaboratve flterng model. In KDD, pages ACM, 008. [13] Y. Koren. Collaboratve flterng wth temporal dynamcs. In KDD, pages ACM, 009. [14] Y. Koren, R. Bell, and C. Volnsky. Matrx factorzaton technques for recommender systems. Computer, 4(8):30 37, 009. [15] B. Lu, Y. Fu, Z. Yao, and H. Xong. Learnng geographcal preferences for pont-of-nterest recommendaton. In KDD, pages ACM, 013. [16] X. Lu, Y. Lu, K. Aberer, and C. Mao. Personalzed pont-of-nterest recommendaton by mnng users preference transton. In CIKM, pages ACM, 013. [17] H. Ma. An expermental study on mplct socal recommendaton. In SIGIR, pages ACM, 013. [18] S. Moghaddam, M. Jamal, and M. Ester. ETF: Extended tensor factorzaton model for personalzng predcton of revew helpfulness. In WSDM, pages ACM, 01. [19] N. Natarajan, D. Shn, and I. S. Dhllon. Whch app wll you use next?: Collaboratve flterng wth nteractonal context. In RecSys, pages ACM, 013. [0] A. Rae, V. Murdock, A. Popescu, and H. Bouchard. Mnng the web for ponts of nterest. In SIGIR, pages , 01. [1] B. Sarwar, G. Karyps, J. Konstan, and J. Redl. Item-based collaboratve flterng recommendaton algorthms. In WWW, pages ACM, 001. [] H. Steck. Item popularty and recommendaton accuracy. In RecSys, pages ACM, 011. [3] W. R. Tobler. A computer move smulatng urban growth n the detrot regon. Economc geography, 46:34 40, [4] D. Yang, T. Chen, W. Zhang, Q. Lu, and Y. Yu. Local mplct feedback mnng for musc recommendaton. In RecSys, pages ACM, 01. [5] M. Ye, P. Yn, W.-C. Lee, and D.-L. Lee. Explotng geographcal nfluence for collaboratve pont-of-nterest recommendaton. In SIGIR, pages ACM, 011. [6] Q. Yuan, G. Cong, Z. Ma, A. Sun, and N. M. Thalmann. Tme-aware pont-of-nterest recommendaton. In SIGIR, pages ACM, 013. APPENDIX A. PARAMETER ESTIMATION All the objectve functons (e.g., Equatons 6, 7, 8, and 9) n the proposed models share the same form. Next, we detal the parameter estmaton for Equaton 9 (where z = β ρ + β u τ u, ) as an example usng Stochastc Gradent Descent (SGD) algorthm [1]. Let e u be the error assocated wth the predcton e u = r u ˆr u. The parameters are learned by movng n the opposte drecton of the gradent wth a learnng rate γ n an teratve manner. In our experments, learnng rate γ s set to n the frst teraton and s decreased by a factor of 0.9 after each subsequent teraton. b u b u + γ (e u λ b u ) b b + γ (e u λ b ) β β + γ (e ) u ρ λ β β u β u + γ (e u τ u, λ β u ) p u p u + γ e u 1 R + α d c λ C 1 p u c C ( w R : q w q w + γ e u n N : v n v n + γ c C : d c d c + γ ( e u ( e u w R q w + α 1 N n N v n ) 1 p u λ R 1 q w ) α 1 p u λ N 3 v n ) α p u λ C 3 d c

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Recommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm

Recommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

IN recent years, recommender systems, which help users discover

IN recent years, recommender systems, which help users discover Heterogeneous Informaton Network Embeddng for Recommendaton Chuan Sh, Member, IEEE, Bnbn Hu, Wayne Xn Zhao Member, IEEE and Phlp S. Yu, Fellow, IEEE 1 arxv:1711.10730v1 [cs.si] 29 Nov 2017 Abstract Due

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

Feature-Based Matrix Factorization

Feature-Based Matrix Factorization Feature-Based Matrx Factorzaton arxv:1109.2271v3 [cs.ai] 29 Dec 2011 Tanq Chen, Zhao Zheng, Quxa Lu, Wenan Zhang, Yong Yu {tqchen,zhengzhao,luquxa,wnzhang,yyu}@apex.stu.edu.cn Apex Data & Knowledge Management

More information

Point-of-Interest Recommender Systems: A Separate-Space Perspective

Point-of-Interest Recommender Systems: A Separate-Space Perspective Pont-of-Interest Recommender Systems: A Separate-Space Perspectve Huayu L +, Rchang Hong, Sha Zhu and Yong Ge + + {hl38,yong.ge}@uncc.edu, hongrc@hfut.edu.cn, zsha@gmal.com + UC Charlotte, Hefe Unversty

More information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Signed Distance-based Deep Memory Recommender

Signed Distance-based Deep Memory Recommender Sgned Dstance-based Deep Memory Recommender ABSTRACT Personalzed recommendaton algorthms learn a user s preference for an tem, by measurng a dstance/smlarty between them. However, some of exstng recommendaton

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

User Tweets based Genre Prediction and Movie Recommendation using LSI and SVD

User Tweets based Genre Prediction and Movie Recommendation using LSI and SVD User Tweets based Genre Predcton and Move Recommendaton usng LSI and SVD Saksh Bansal, Chetna Gupta Department of CSE/IT Jaypee Insttute of Informaton Technology,sec-62 Noda, Inda sakshbansal76@gmal.com,

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

CLiMF: Learning to Maximize Reciprocal Rank with Collaborative Less-is-More Filtering

CLiMF: Learning to Maximize Reciprocal Rank with Collaborative Less-is-More Filtering CLMF: Learnng to Maxmze Recprocal Rank wth Collaboratve Less-s-More Flterng Yue Sh Delft Unversty of Technology y.sh@tudelft.nl Martha Larson Delft Unversty of Technology m.a.larson@tudelft.nl Alexandros

More information

Enhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques

Enhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques Enhancement of Infrequent Purchased Product Recommendaton Usng Data Mnng Technques Noraswalza Abdullah, Yue Xu, Shlomo Geva, and Mark Loo Dscplne of Computer Scence Faculty of Scence and Technology Queensland

More information

Collaborative Filtering Ensemble for Ranking

Collaborative Filtering Ensemble for Ranking Collaboratve Flterng Ensemble for Rankng ABSTRACT Mchael Jahrer commo research & consultng 8580 Köflach, Austra mchael.ahrer@commo.at Ths paper provdes the soluton of the team commo on the Track2 dataset

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

An Item-Targeted User Similarity Method for Data Service Recommendation

An Item-Targeted User Similarity Method for Data Service Recommendation 01 IEEE 16th Internatonal Enterprse Dstrbuted Object Computng Conference Workshops An Item-Targeted User Smlarty Method for Data Serce Recommendaton Cheng Zhang, Xaofang Zhao Insttute of Computng Technology

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

More information

Utilizing Content to Enhance a Usage-Based Method for Web Recommendation based on Q-Learning

Utilizing Content to Enhance a Usage-Based Method for Web Recommendation based on Q-Learning Proceedngs of the Twenty-Frst Internatonal FLAIS Conference (2008) Utlzng Content to Enhance a Usage-Based Method for Web ecommendaton based on Q-Learnng Nma Taghpour Department of Computer Engneerng Amrkabr

More information

Data Mining: Model Evaluation

Data Mining: Model Evaluation Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK L-qng Qu, Yong-quan Lang 2, Jng-Chen 3, 2 College of Informaton Scence and Technology, Shandong Unversty of Scence and Technology,

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Collaboratively Regularized Nearest Points for Set Based Recognition

Collaboratively Regularized Nearest Points for Set Based Recognition Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

CS246: Mining Massive Datasets Jure Leskovec, Stanford University CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd

More information

Adaptive Transfer Learning

Adaptive Transfer Learning Adaptve Transfer Learnng Bn Cao, Snno Jaln Pan, Yu Zhang, Dt-Yan Yeung, Qang Yang Hong Kong Unversty of Scence and Technology Clear Water Bay, Kowloon, Hong Kong {caobn,snnopan,zhangyu,dyyeung,qyang}@cse.ust.hk

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

Effective Page Recommendation Algorithms Based on. Distributed Learning Automata and Weighted Association. Rules

Effective Page Recommendation Algorithms Based on. Distributed Learning Automata and Weighted Association. Rules Effectve Page Recommendaton Algorthms Based on Dstrbuted Learnng Automata and Weghted Assocaton Rules R. Forsat 1*, M. R. Meybod 2 1 Department of Computer Engneerng, Islamc Azad Unversty, Karaj Branch,

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Adapting Ratings in Memory-Based Collaborative Filtering using Linear Regression

Adapting Ratings in Memory-Based Collaborative Filtering using Linear Regression Adaptng Ratngs n Memory-Based Collaboratve Flterng usng Lnear Regresson Jérôme Kunegs, Şahn Albayrak Technsche Unverstät Berln DAI-Labor Franklnstraße 8/9 10587 Berln, Germany {kunegs,sahn.albayrak}@da-labor.de

More information

arxiv: v1 [cs.cy] 26 Nov 2017

arxiv: v1 [cs.cy] 26 Nov 2017 Smartphone App Usage Predcton Usng Ponts of Interest DONGHAN YU, YONG LI, FENGLI XU, Tsnghua Unversty PENGYU ZHANG, Stanford Unversty VASSILIS KOSTAKOS, Unversty of Melbourne arxv:1711.09337v1 [cs.cy]

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Assessing the Value of Unrated Items in Collaborative Filtering

Assessing the Value of Unrated Items in Collaborative Filtering Assessng the Value of Unrated Items n Collaboratve Flterng Jérôme Kunegs, Andreas Lommatzsch, Martn Mehltz, Şahn Albayrak Technsche Unverstät Berln DAI-Labor Ernst-Reuter-Platz 7, 0587 Berln, Germany {kunegs,andreas.lommatzsch,martn.mehltz,sahn.albayrak}@da-labor.de

More information

ONLINE social networks (OSN), such as Facebook

ONLINE social networks (OSN), such as Facebook IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 1 Collaboratve Flterng-Based Recommendaton of Onlne Socal Votng Xwang Yang, Chao Lang, Mao Zhao, Member, IEEE, Hongwe Wang, Hao Dng, Yong Lu, Fellow, IEEE,

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

CLiMF: Collaborative Less-Is-More Filtering

CLiMF: Collaborative Less-Is-More Filtering Proceedngs of the Twenty-Thrd Internatonal Jont Conference on Artfcal Intellgence CLMF: Collaboratve Less-Is-More Flterng Yue Sh Delft Unversty of Technology y.sh@tudelft.nl Martha Larson Delft Unversty

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

A General Embedding Framework for Heterogeneous Information Learning in Large-Scale Networks

A General Embedding Framework for Heterogeneous Information Learning in Large-Scale Networks 1 A General Embeddng Framework for Heterogeneous Informaton Learnng n Large-Scale Networks XIAO HUANG, Texas A&M Unversty, USA JUNDONG LI, Arzona State Unversty, USA NA ZOU, Texas A&M Unversty, USA XIA

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Gaussian Process Factorization Machines for Context-aware Recommendations

Gaussian Process Factorization Machines for Context-aware Recommendations Gaussan Process Factorzaton Machnes for Context-aware Recommendatons Trung V. Nguyen ANU & NICTA Canberra, Australa u5075561@anu.edu.au Alexandros Karatzoglou Telefonca Research Barcelona, Span alexk@td.es

More information

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league

More information

arxiv: v1 [cs.ir] 24 Apr 2016

arxiv: v1 [cs.ir] 24 Apr 2016 Analyzng User Preference for Socal Image Recommendaton Xan-Mng Lu Unversty of Illnos at Urbana-Champagn Urbana, IL, USA xlu02@llnos.edu Mn-Hsuan Tsa Google Inc. Thomas S. Huang Unversty of Illnos at Urbana-Champagn

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms 3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

Learning physical Models of Robots

Learning physical Models of Robots Learnng physcal Models of Robots Jochen Mück Technsche Unverstät Darmstadt jochen.mueck@googlemal.com Abstract In robotcs good physcal models are needed to provde approprate moton control for dfferent

More information

Available online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )

Available online at   ScienceDirect. Procedia Environmental Sciences 26 (2015 ) Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc

More information

Deep Classification in Large-scale Text Hierarchies

Deep Classification in Large-scale Text Hierarchies Deep Classfcaton n Large-scale Text Herarches Gu-Rong Xue Dkan Xng Qang Yang 2 Yong Yu Dept. of Computer Scence and Engneerng Shangha Jao-Tong Unversty {grxue, dkxng, yyu}@apex.sjtu.edu.cn 2 Hong Kong

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

LinkSelector: A Web Mining Approach to. Hyperlink Selection for Web Portals

LinkSelector: A Web Mining Approach to. Hyperlink Selection for Web Portals nkselector: A Web Mnng Approach to Hyperlnk Selecton for Web Portals Xao Fang and Olva R. u Sheng Department of Management Informaton Systems Unversty of Arzona, AZ 8572 {xfang,sheng}@bpa.arzona.edu Submtted

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Experiments in Text Categorization Using Term Selection by Distance to Transition Point

Experiments in Text Categorization Using Term Selection by Distance to Transition Point Experments n Text Categorzaton Usng Term Selecton by Dstance to Transton Pont Edgar Moyotl-Hernández, Héctor Jménez-Salazar Facultad de Cencas de la Computacón, B. Unversdad Autónoma de Puebla, 14 Sur

More information

The Effect of Similarity Measures on The Quality of Query Clusters

The Effect of Similarity Measures on The Quality of Query Clusters The effect of smlarty measures on the qualty of query clusters. Fu. L., Goh, D.H., Foo, S., & Na, J.C. (2004). Journal of Informaton Scence, 30(5) 396-407 The Effect of Smlarty Measures on The Qualty of

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

Three supervised learning methods on pen digits character recognition dataset

Three supervised learning methods on pen digits character recognition dataset Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru

More information

Abstract. 1 Introduction

Abstract. 1 Introduction Challenges and Solutons for Synthess of Knowledge Regardng Collaboratve Flterng Algorthms Danel Lowd, Olver Godde, Matthew McLaughln, Shuzhen Nong, Yun Wang, and Jonathan L. Herlocker. School of Electrcal

More information