A simple hybrid movie recommender system

Size: px
Start display at page:

Download "A simple hybrid movie recommender system"

Transcription

1 A simple hybrid movie recommeder system Jaldert Rombouts Tessa Verhoef Abstract A simple hybrid movie recommeder system is described that combies cotet based ad collaborative modellig ad provides a explaatio for icreased user acceptace. The system uses ratig data from the Netflix database which is liked to cotet iformatio from the Iteret Movie Database. I order to provide the user with isight ito the reasoig behid a recommedatio, the system creates a HTML page with a detailed explaatio. Performace results are preseted as well as a discussio o future improvemets. Keywords: Recommeder systems; Collaborative filterig; Cotet based filterig; user acceptace; aive Bayes Itroductio We live i a iformatio society i which people are ofte cofroted with very large amouts of data, for istace through the iteret. We are asked to make choices that are almost impossible to make without additioal iformatio or guidace. Recommeder systems ca provide such guidace by assistig the user i the decisio makig process or by makig the decisio for the user. These systems use the eormous amout of available data i a way that users ever ca. Recommeder system are already beig used i a lot of differet domais. GroupLes (Resick, Iacovou, Suchak, Bergstorm, & Riedl, 1994), for istace, is a system that recommeds ews articles that could be of iterest to the user. AbeBooks recommeds books, Last.fm helps the user to fid ew music ad MovieLes, IMDb ad Netflix recommed movies. Amazo.com is a recommeder that is specialized i all three previously metioed media. Collaborative filterig Varyig approaches for automatic recommedatio have bee proposed. The oldest ad most developed method is collaborative filterig. This method uses iter-user comparisos to geerate ew recommedatios. A collaborative system cosists of a database which cotais the users ratigs ad is augmeted as the user iteracts with the system over time. Users are compared based o their ratigs ad the obtaied similarities ad differeces are used to make a recommedatio. Collaborative filterig suffers from the sparsity problem. Not all users exploit the optio to rate items they have see or used. The available ratig data is therefore typically very sparse, especially whe a user is ew or whe the system is ew ad people are just startig to use it. Aother problem is the first-rater problem: before a item has bee recommeded for the first time, the system will ot recommed it. This problem applies to ew items ad obscure items which makes it less attractive for people with o-maistream tastes. A virtue of collaborative filterig is that it ca surprise the user with relevat items that are ot explicitly similar to items i the users profile. This so called outside the box recommedatio ability (Burke, 2002) is possible because it uses people-to-people correlatios. Cotet based methods Aother method uses cotet based iformatio. Cotet based filterig uses item-to-item correlatio to compare represetatios of cotet i a item to represetatios of cotet i items the user has rated. The similarities betwee items ad the ratig iformatio are used to predict how much the user will like or dislike a ew item. A disadvatage of this method is that it is completely depedet upo machie readable represetatios of items, which may be difficult to obtai. Cotet based methods are ot able to surprise the user, because it uses the feature values of the items that the user has rated ad will ot recommed a item that does ot share ay of these values. Just as collaborative filterig, cotet based methods also suffer from the sparsity problem. Hybrid methods Collaborative filterig ad cotet based methods have varyig advatages ad disadvatages. A combiatio of the two methods therefore provides a promisig extesio. Differet ways have bee proposed ad used to combie two differet recommeders (Burke, 2002). Weightig is a simple method that computes a recommedatio from the results of all idividual recommeders, for istace by liearly combiig them or by a votig mechaism (Pazzai, 1999). This is a very straightforward method that makes easy adjustmets possible, but it also uses the implicit assumptio that the relative value of the differet recommeders is uiform for all items, which is ofte ot the case. As a alterative, switchig techiques ca be used, that use a criterio fuctio to decide whe to switch from oe recommeder to the other (Tra & Cohe, 2000). Basu, Hirsh, ad Cohe (1998) proposed a method i which they use the iformatio of oe recommeder as features for the other. The ratig iformatio from the collaborative part is used as a additioal feature ad cotet based filterig is doe o the complete data set, icludig this ew feature. Cascadig differet recommeders is aother way to combie them which ivolves a staged process. Melville, Mooey, ad Nagaraja (2002) for istace use a cotet boosted collaborative filterig techique, i which they first solve the sparsity problem by makig virtual data usig cotet based iformatio, ad the use collaborative filterig o this much larger data set. Explaatio Recommeder systems are widely used, especially i the olie commuity, but up to ow the applicatio areas of the

2 techique have bee limited to harmless decisio makig i the etertaimet domai. For more serious issues, like bookig a vacatio, buyig isurace or stock market decisios, people do ot trust the techique eough to let it make these decisios for them. Oe way to overcome this distrust is to provide the user with a explaatio (Herlocker, Kosta, & Riedl, 2000). I the eyes of a user, a recommeder system is a black box, which makes it hard to uderstad why a certai decisio has bee made. A explaatio ca provide more isight ito the reasoig behid the decisio ad also gives the user the opportuity to judge, accordig to this reasoig, whether to trust the decisio or ot. It should make the system more trasparet. It has bee show experimetally that explaatios icrease the acceptace of both expert systems ad recommeder systems, or i geeral, decisio support systems (Herlocker et al., 2000; Ye & Johso, 1995). I the followig sectios our hybrid movie recommeder system is described. Collaborative filterig is liearly combied with a aive Bayesia cotet based approach to predict the movie preferece of a user. The system provides the user with a isightful explaatio that justifies the decisio. First the problem domai ad the system are described, the the result of experimets o the performace are reported ad a discussio follows after that. Domai Method The proposed system for movie recommedatio uses both collaborative filterig ad cotet based modellig ad is supposed to perform the followig task: for a certai user, decide which oe of two proposed movies will probably be favored by the user. Two databases are combied ad used: Netflix 1, providig ratig iformatio for the collaborative part, ad the Iteret Movie Database (IMDb) 2 for extractig cotet iformatio. The Netflix database cosists of ratig iformatio of differet users. The ratigs are raged from oe to five stars. Oe star idicates that a user does ot like the movie ad five stars meas the user loves it. The database cotais differet movies, of which 8637 are used because these movies could be liked to the cotet iformatio that is available from the Iteret Movie Database (IMDb). To be able to use the iformatio from both databases, a MySQL database was created from which the iformatio could be extracted usig simple queries. Because of the itese data-depedecy ad large calculatios ivolved i collaborative filterig, we decided to use PyFlix 3, a off the shelf Pytho tool for accessig the Netflix dataset, which was a lot faster tha our MySQL database System The system is a liear combiatio (50-50) of the predictios of the cotet based model ad the collaborative filter discussed below. Cotet based modellig The cotet based part of the movie recommeder is based o a aive Bayesia text classificatio method (Mitchell, 1997). The classifier creates a aive Bayesia model for every user, based o the cotet of the movies the user has rated. The cotet that is used are the keywords, geres ad actors of a movie ad these features are assiged to a appropriate class: 1, 2, 3, 4 or 5, based o the ratig for that movie. For every feature type, a separate model is created ad the predictios of these models are liearly combied ito oe predictio. The umber of possible feature values of the keywords ad actors would be very large if all possible values were to be used sice there is a huge amout of differet keywords ad differet actors. To be able to keep the feature vectors maageable, oly the keywords are used that occur more tha 20 times (8762 i total) ad oly the actors are used that occur more tha 50 times i the data set (34956 i total). We are iterested i the posterior probability of a certai ratig/class (c), give the observatio of movie features (o) for a ew movie. Usig Bayes Theorem, this ca be defied as: p(c o) = p(c)p(o c) (1) p(o) Sice the deomiator i this equatio does ot deped o c ad we ca make use of the aive assumptio that every feature f i i the observatio is coditioally idepedet of every other feature, we ca rewrite the fuctio as: p(c o) = p(c) p( f i c) (2) where is the umber of features. I order to classify the movie, we eed to fid the maximum posterior probability of the five classes: classi f y( f i... f ) = max p(c = c) p(f i = f i C = c) (3) So, the class/ratig with the highest posterior probability for this movie is the predicted ratig o which the system bases its recommedatio. A disadvatage of this method is that it has to estimate the prior ad coditioal probabilities from the data, while the data is typically sparse. Direct probability calculatio ca therefore ofte give probabilities that are zero, which is udesirable. For this reaso we use Laplacia smoothig (Mitchell, 1997) to elimiate zeros from the estimated probabilities. What this comes dow to is that it adds a umber of additioal halluciated examples. These examples are spread evely over the possible values. I this case, every possible observatio starts from a frequecy of oe, istead of

3 zero ad the prior frequecy of a class starts from the umber of possible feature values, for istace the umber of possible geres. Our estimate for the prior probability of a class ow becomes: p(c) = c + f t (4) where c is the umber of observatios for class c, f is the umber of possible feature values ad t is the total umber of observatios. The estimate for the coditioal probability becomes: p(o c) = o + 1 c + f (5) where o is the frequecy with which a certai observatio has bee ecoutered i associatio with class c. If the umber of possible observatios becomes very high, the probabilities ca get very small, so i order to avoid uderflow, the log-likelihoods are used. The predictios of the three models are liearly combied ito oe recommedatio i a way that yielded the best performace. It uses 60 percet of the predictio based o keywords, 30 percet of the predictio based o actors ad 10 percet of the predictio based o geres. This is mostly due to the fact that actors ad geres are less ofte kow tha keywords, ad because there is much less variatio i the geres. Collaborative filterig The collaborative part of the system is heavily based o the system described by Herlocker, Kosta, ad Riedl (1999), which is a eighbourhood-based approach to collaborative filterig. The approach cosists of three steps: 1. Calculate the similarity of the active 4 user to other users; 2. Select users that are most similar to the active user: they form the eighbourhood; 3. Calculate a predictio based o a weighted combiatio of the eighbours ratigs. Like Herlocker et al. (1999), we use the Pearso correlatio coefficiet to calculate the similarity betwee two users: P a,u = m (r a,i r a ) (r u,i r u ) m (r a,i r a ) 2 m (r a,u r u ) 2 (6) P a,u is the similarity betwee the active user a ad aother user u, r i, j is the ratig that user i has give to item j, r i is the average ratig that user i has give, ad m is the total umber of items that both users have i commo. Give that the similarity oly depeds o the co-rated items of two users, it is possible to have a high correlatio betwee users while this is i fact ot the case. For istace, if two users have both rated 500 items, but have oly two co-rated 4 This is the user for which we are calculatig a predictio. items, their correlatio ca still be perfect if they agree o these two items. I order to compesate for this effect, we adopted sigificace-weightig as proposed by Herlocker et al. (1999). This ca be described by the followig formula, where is the umber of overlappig items, ad θ is the threshold value: { /θ Pa,u if < θ; P a,u = P a,u otherwise. We adopted a θ value of 50 which meas that two users should have at least 50 overlappig items, or the corrrelatio for this pair is reduced. To calculate the similarities betwee all users (2 ) 2 comparisos are eeded, where is the total umber of users. Give the large amout of users i the Netflix set, this is ot feasible o a ormal computer. I order to get the umber of comparisos dow, we did a preselectio step o the users to evaluate as eighbours. First, oly select users that have see the item that we wat to rate for the active user, ad the radomly select of these users. So, i the worst case sceario, the algorithm eeds to calculate similarities. We used this value because it yielded a acceptable rutime for evaluatig oe (user,item) pair o our hardware. Note that we oly add users with a positive ozero correlatio to the list of possible eighbours: accordig to Shardaad ad Maes (1995) icludig egative correlatios makes o real differece. The described strategy for selectig possible eighbours holds aother advatage: we kow that all eighbours have rated the item of iterest, so all ca have a ifluece o the fial predictio. If you would just select the top- users i the aive way, there is o guaratee that these eighbours have actually rated the item of iterest, i which case their vote would be lost. The last step is combiig the ratigs of the eighbours ito a predictio for the active user. The simplest approach would just take all ratigs for the item by the eighbours, ad multiply this by the weight of that eighbour, ad divide the total by the total weight of the eighbours. Herlocker et al. (1999) show that this approach is ot very good, because it does ot compesate for the fact that every user rates differetly. Some users oly give five stars to items that they really love, ad others are ot as striget with their ratigs. A way to compesate for this is to use the deviatio-from-mea average for all users, as detailed i Herlocker et al. (1999). I this way, whe a user always gives high ratigs to items, his vote will be worth less whe his ratig for the item of iterest is also high. The predictio algorithm cosists of the average ratig of the active user which is modulated by the ratigs of the eighbours (our implemetatio uses 50 eighbours). The algorithm calculates its predictio as follows: p a,i = r a + u=1 (r u,i r u ) P a,u u=1 P a,u (7) (8)

4 If the preselectio step does ot yield ay eighbours for the user, the algorithm returs the best ratig estimate it ca fid for that item. This estimate is the deviatio-from-mea average for all users that have rated this movie plus the average of the active user. If the algorithm does fid eighbours it calculates the the predictio as discussed. Explaatio To icrease the user acceptace of the recommeder system we created a explaatio module that provides the user with detailed iformatio i HTML format to justify the decisio. The explaatio gives the user isight ito the reasoig behid the decisio of both the collaborative model ad the cotet based model ad both algorithms also idicate how certai they are of this decisio i order to give the user the opportuity to judge how trustworthy the decisio is. The fial decisio is also preseted accompaied by this certaity idicatio. There are three grades of certaity that the system ca express: ot very certai, reasoably certai or certai. The implemetatio for this is actually almost trivial: if the differece betwee predictios is small, it wil say that it is ot very certai, ad if the differece is almost a whole star, it will say that it is more cofidet. The thresholds for these decisios were foud through maual experimetatio. Figure 1 i appedix B gives a impressio of the user iterface. The explaatio of the cotet based model is provided to the user i a small story. This story tells the user which features of the two movies caused the system to recommed oe movie over the other. For istace, because the actors i oe movie have bee associated with higher movie rakigs tha the actors i the other movie. The difficulty with these explaatios is that it is very hard to determie which type of feature is resposible for a high or a low ratig. The recommeder oly takes the keywords, actors ad geres ito accout, but what a perso likes or dislikes about a movie might just as well be caused by the ifluece of a director or a certai style of filmig. Due to this credit assigmet problem the explaatio is purely based o the coclusios draw by the aive Bayesia model which does ot always ecessarily correspod with the real prefereces of the user. The user will be able to recogize such a deviatio from his or her ow prefereces ad ca decide whether to trust the recommedatio or ot. The credit assigmet problem will be further discussed i the discussio sectio. We have based the explaatio of the collaborative part of our system o the work of Herlocker et al. (2000). Because the system is actually a complex mathematical model, spellig out how the algorithm works does ot cout as a explaatio. They cocluded that a simple graph showig what the eighbours had rated worked best. We implemeted this feature for our explaatio: it is icluded o the bottom right of the user iterface, see figure 1 i appedix B. Because the system must give a rakig for two movies, eighbours for two movies are visible (if there are ay). There are oly three groups, where the middle group idicates the umber of eighbours that have rated the movies with tree stars. If the distributio has its ceter of gravity to the right, the eighbours thought that the movie was good, ad if it is at the left, they thought that it was a bad movie. Note that this is ot the exact iformatio that the system uses, sice some users have more weight tha others ad these weights are combied as show i equatio (8), but i practice this graph gives a clear impressio, which almost always correspods to the decisio. You ca also see o how much eighbours the decisio is based, which is also some idicatio for the correctess of the decisio of the algorithm. Performace The performace of the hybrid recommeder was tested, but also the performace of the idividual recommeders. The task is defied as a rakig task i which the recommeder has to decide which movie of two movies that are ew for the user will be the most favorable. The predicted rakigs are compared to the actual rakigs with a repeated crossvalidatio approach. The rakig is based o a compariso of the two predicted ratigs for the movies. To provide more isight ito the performace for these predictios, these estimated ratigs are also tested. A Root Mea Squared Error calculatio is used to determie the error i the predictio (p) compared to the real ratig (r) after predictios: RMSE = 1 (p r) 2 (9) The performace of the idividual recommeders was tested usig cross-validatio. I te trials, 100 radom users (who had rated at least two movies for which cotet iformatio was available) were selected. Two movies were extracted from the total amout the user had rated ad the models were created usig the data of the remaiig movies. The the recommeders were asked to classify the two selected movies ad the predicted rakigs ad ratigs were compared. Determiig whether the rakig is correct is ot as trivial as it seems: for istace, what is the correct aswer whe the user has give both test items the same ratig? We decided that ay rakig would cout as correct i this case. The result of the te trials shows that the average umber of correct rakigs for the cotet based model is 86% with a stadard deviatio of 3.37%. The rakig performace of the collaborative model is 88% with a stadard deviatio of 2.65%. The predicted ratigs of the cotet based model deviated from the actual ratigs with a average RMSE of 0.87 with a stadard deviatio of The ratig error of the collaborative model was o average 0.88 with a stadard deviatio of I our implemetatio, the combied classifier was much slower tha the idividual classifiers, takig about 1-4 miutes per test case. This is the reaso why we did ot test the combied classifier as extesively as the idividual classifiers. The result was a correct rakig of 88.25%, with a stadard deviatio of 1.5%. The average RMSE was 0.83

5 with a stadard deviatio of 0.05 This is based o four experimets with 50 tests each, so it is hard to say how this compares to the idividual compoets. Discussio It is very hard to compare our results to other work, because almost all writers use differet databases for traiig ad validatig their algorithm. Eve if the writers have used the same database it ca still be that the results are hard to compare because the authors have made differet assumptios ad their algorithms have differet precoditios. I our case for istace, both test movies eed to be liked to the IMDB database i order to get a predictio. So, users have see at least two movies, but give that the probability that we have liked a movie with IMDB is about 50% you would expect that these users have see more tha two movies. I this way, our algorithm sidesteps oe of the real problems of recommeder systems: doig predictios for users that have see very few items. It should be clear that our system is ot early as good as that of the curret leaders i the Netflixchallege 5, which have a RMSE of about 0.86! Both our systems, ad most recommeder systems i geeral, are highly depedet o ratigs that users have give for certai items. It is a importat questio whether these ratigs ca be cosidered reliable. The five poit ratig scale that is used by Netflix is a arbitrary scale ad it has bee show that chagig the scale s rage ca alter the distributio of resposes (Amoo & Friedma, 2001). Excludig a middle choice, for istace, has bee foud to bias towards positive resposes. The ratig behaviour of users is also iflueced by the predictios that recommeder systems make (Cosley, Lam, Albert, Kosta, & Riedl, 2003), which makes it harder for the system to accurately model the users prefereces. To improve the performace of recommeder systems i the future, it might be beeficial to cosider alterative ratig mechaisms. The credit assigmet problem that was metioed earlier is a problem that ot oly affects the explaatio that the system gives, but it is a geeral disadvatage for cotet based methods that we caot objectively determie which part of the cotet was the decidig factor behid a high or a low ratig. Why do people like The Godfather so much? Is it the actors, or the gere? Or do people like it because it is directed by Fracis Ford Coppola ad they like his style? We would ever o uless we ask the user. Predictios of cotet based recommeders could improve if we would ask the user why they give a specific ratig. There are a few disadvatages of the eighbourhood preselectio as used i the collaborative part of the system. The first is perhaps coceptual: the eighbours for both movies are ot actually the same eighbours, there does ot have to be ay overlap betwee these differet groups of users, while the iterface gives the impressio that this is the case. Aother problem is that the system does ot have to be cosis- 5 tet i a ratig for a user ad the same two items, because it selects radom users i the preselectio stage ad if there are more tha users that have see a items, there is a probability that the top-50 eighbours will ot be the same. This is a trade-off that we eeded to make i order to achieve a feasible rutime. Whether the predictios provided by our algorithm are worse tha eighbours calculated i the aive way is somethig that is worth lookig ito. A poit for improvemet lies i the way that the collaborative system calculates the correlatios betwee two users. The solutio offered by Herlocker et al. (1999) that we adopted seems more like a hack tha a real solutio for this problem. There probably are statistical tools that will offer a more solid foudatio for this decisio, e.g. where the cofidece iterval becomes larger if the overlap betwee two users becomes smaller. This will almost certaily have a positive effect o the predictios. Aother poit for improvemet is the way the fial predictios are calculated: if a user has a large umber of eighbours for the first item ad a very small umber of eighbours for the secod item, the votes of the latter eighbours will weigh more heavily. This is also the case whe you use ormal eighbourhood-based methods, i which ot all eighbours have rated both items. The combiatio of the classifiers was doe i a liear fashio, because this is relatively easy to do by had. But, it is probably the case that the weights that we used for combiig them are probably ot the best oes. Also, it is possible that a liear combiatio of the classifiers ot the best solutio to combie them. It also eeds to be metioed that we did ot evaluate the user-iterface of the recommeder system: we followed the suggestios of Herlocker et al. (2000) ad our ow ituitios about what kid of explaatios users would fid acceptable, but we did ot test the system o real ed-users. This is somethig that eeds to be doe i future research. I coclusio, it has bee show that a simple hybrid recommeder system performs reasoably well o a movie recommedatio task ad ca also provide the user with a isightful explaatio that makes the system ad its separate recommeders more trasparet. The advatage of usig a combiatio of differet classifiers is ot oly that they compesate for each others shortcomigs, but also that the combiatio of explaatios provides a detailed descriptio of the reasoig behid the recommedatio. Refereces Amoo, T., & Friedma, H. (2001, February). Do umeric values ifluece subjects resposes to ratig scales? Joural of Iteratioal Marketig ad Marketig Research, 26, Basu, C., Hirsh, H., & Cohe, W. (1998). Recommedatio as classificatio: Usig social ad cotet-based iformatio i recommedatio. Proceedigs of the Fifteeth Natioal Coferece o Artificial Itelligece,

6 Burke, R. (2002). Hybrid Recommeder Systems: Survey ad Experimets. User Modelig ad User-Adapted Iteractio, 12(4), Cosley, D., Lam, S., Albert, I., Kosta, J., & Riedl, J. (2003). Is seeig believig?: how recommeder system iterfaces affect users opiios. Proceedigs of the SIGCHI coferece o Huma factors i computig systems, Herlocker, J., Kosta, J., & Riedl, J. (1999). A algorithmic framework for performig collaborative filterig. Proceedigs of the 22d aual iteratioal ACM SIGIR coferece o Research ad developmet i iformatio retrieval, Herlocker, J., Kosta, J., & Riedl, J. (2000). Explaiig collaborative filterig recommedatios. Proceedigs of the 2000 ACM coferece o Computer supported cooperative work, Melville, P., Mooey, R., & Nagaraja, R. (2002). Cotet- Boosted Collaborative Filterig for Improved Recommedatios. Proceedigs of the Eighteeth Natioal Coferece o Artificial Itelligece, Mitchell, C. (1997). Machie Learig. The McGraw-Hill Compaies, Ic. Pazzai, M. (1999). A Framework for Collaborative, Cotet-Based ad Demographic Filterig. Artificial Itelligece Review, 13(5), Resick, P., Iacovou, N., Suchak, M., Bergstorm, P., & Riedl, J. (1994). GroupLes: A Ope Architecture for Collaborative Filterig of Netews. I Proceedigs of ACM 1994 Coferece o Computer Supported Cooperative Work (pp ). ACM. Shardaad, U., & Maes, P. (1995). Social iformatio filterig: algorithms for automatig word of mouth. Proceedigs of the SIGCHI coferece o Huma factors i computig systems, Tra, T., & Cohe, R. (2000). Hybrid Recommeder Systems for Electroic Commerce. Kowledge-Based Electroic Markets, Papers from the AAAI Workshop, Techical Report WS-00, 4. Ye, L., & Johso, P. (1995). The Impact of Explaatio Facilities o User Acceptace of Expert Systems Advice. MIS Quarterly, 19(2), Appedix A. Item-item collaborative filterig Aother collaborative modellig algorithm was developed which uses item-item similarity, based o comparig user ratigs for these items. The algorithm is very simple: 1. Calculate the distace betwee the movie of iterest ad all movies that the active user has see; 2. Normalize the distaces, so the largest distace equals 1 3. Calculate the predictio based o these distaces. We use the Euclidea distace as a distace measure: m D(a,b) = (r i,a r i,b ) 2 (10) Where m is the umber of users that two movies have i commo ad r i,x is the ratig for a item x of such a user i. Note that this approach suffers from the same problem as the other algorithm: if the overlap is small, the calculated distace will ot be a realistic estimate. We adapted the sigificace weighig strategy as follows to work with distaces istead of correlatio values (θ = 10000): { D(a,b) (θ/) if < θ; D(a,b) = (11) D(a, b) otherwise. Now, all distaces are ormalized by dividig all distaces by the largest distace foud, so every distace is a value i the iterval [0,1]. I order to calculate a predictio we select the top-15 items that are most similar to the item of iterest. Now we use a simple calculatio for the predictio: p a,i = 15 j=1 (1 D(i, j)) r a, j (12) Where p a,i is the predictio for the ratig that user a will give the item of iterest i, ad r a,i is the ratig that user a has give item j. The performace of this algorithm was ot quite as good as we expected, ofte scorig worse tha a simple model that always retured a ratig of 3 (average rmse was 1.55 (stadard deviatio 0.10) for 5 groups cosistig of 100 tests). We thought it was ice to iclude because it is a collaborative approach that works o differet data tha the user-user based approach, ad perhaps it will thus prove useful whe combiig classifiers.

7 B. Screeshot of the user iterface Figure 1: Screeshot of the user iterface. The result of the combied classifier is o the top, ad the explaatios for the cotet-based part ad the collaborative part are idicated as Cotet Based ad Peer Based respectively. For referece, this predictio is for user 7 i the etflix dataset, ad compares Gigli to Braveheart.

E-LEARNING USABILITY: A LEARNER-ADAPTED APPROACH BASED ON THE EVALUATION OF LEANER S PREFERENCES. Valentina Terzieva, Yuri Pavlov, Rumen Andreev

E-LEARNING USABILITY: A LEARNER-ADAPTED APPROACH BASED ON THE EVALUATION OF LEANER S PREFERENCES. Valentina Terzieva, Yuri Pavlov, Rumen Andreev Titre du documet / Documet title E-learig usability : A learer-adapted approach based o the evaluatio of leaer's prefereces Auteur(s) / Author(s) TERZIEVA Valetia ; PAVLOV Yuri (1) ; ANDREEV Rume (2) ;

More information

Natural language processing implementation on Romanian ChatBot

Natural language processing implementation on Romanian ChatBot Proceedigs of the 9th WSEAS Iteratioal Coferece o SIMULATION, MODELLING AND OPTIMIZATION Natural laguage processig implemetatio o Romaia ChatBot RALF FABIAN, MARCU ALEXANDRU-NICOLAE Departmet for Iformatics

More information

Fuzzy Reference Gain-Scheduling Approach as Intelligent Agents: FRGS Agent

Fuzzy Reference Gain-Scheduling Approach as Intelligent Agents: FRGS Agent Fuzzy Referece Gai-Schedulig Approach as Itelliget Agets: FRGS Aget J. E. ARAUJO * eresto@lit.ipe.br K. H. KIENITZ # kieitz@ita.br S. A. SANDRI sadra@lac.ipe.br J. D. S. da SILVA demisio@lac.ipe.br * Itegratio

More information

Consortium: North Carolina Community Colleges

Consortium: North Carolina Community Colleges Associatio of Research Libraries / Texas A&M Uiversity www.libqual.org Cotributors Collee Cook Texas A&M Uiversity Fred Heath Uiversity of Texas BruceThompso Texas A&M Uiversity Martha Kyrillidou Associatio

More information

arxiv: v1 [cs.dl] 22 Dec 2016

arxiv: v1 [cs.dl] 22 Dec 2016 ScieceWISE: Topic Modelig over Scietific Literature Networks arxiv:1612.07636v1 [cs.dl] 22 Dec 2016 A. Magalich, V. Gemmetto, D. Garlaschelli, A. Boyarsky Uiversity of Leide, The Netherlads {magalich,

More information

part2 Participatory Processes

part2 Participatory Processes part part2 Participatory Processes Participatory Learig Approaches Whose Learig? Participatory learig is based o the priciple of ope expressio where all sectios of the commuity ad exteral stakeholders

More information

CONSTITUENT VOICE TECHNICAL NOTE 1 INTRODUCING Version 1.1, September 2014

CONSTITUENT VOICE TECHNICAL NOTE 1 INTRODUCING  Version 1.1, September 2014 preview begis oct 2014 lauches ja 2015 INTRODUCING WWW.FEEDBACKCOMMONS.ORG A serviced cloud platform to share ad compare feedback data ad collaboratively develop feedback ad learig practice CONSTITUENT

More information

'Norwegian University of Science and Technology, Department of Computer and Information Science

'Norwegian University of Science and Technology, Department of Computer and Information Science The helpful Patiet Record System: Problem Orieted Ad Kowledge Based Elisabeth Bayega, MS' ad Samso Tu, MS2 'Norwegia Uiversity of Sciece ad Techology, Departmet of Computer ad Iformatio Sciece ad Departmet

More information

HANDBOOK. Career Center Handbook. Tools & Tips for Career Search Success CALIFORNIA STATE UNIVERSITY, SACR AMENTO

HANDBOOK. Career Center Handbook. Tools & Tips for Career Search Success CALIFORNIA STATE UNIVERSITY, SACR AMENTO HANDBOOK Career Ceter Hadbook CALIFORNIA STATE UNIVERSITY, SACR AMENTO Tools & Tips for Career Search Success Academic Advisig ad Career Ceter 6000 J Street Lasse Hall 1013 Sacrameto, CA 95819-6064 916-278-6231

More information

Application for Admission

Application for Admission Applicatio for Admissio Admissio Office PO Box 2900 Illiois Wesleya Uiversity Bloomig, Illiois 61702-2900 Apply o-lie at: www.iwu.edu Applicatio Iformatio I am applyig: Early Actio Regular Decisio Early

More information

Management Science Letters

Management Science Letters Maagemet Sciece Letters 4 (24) 2 26 Cotets lists available at GrowigSciece Maagemet Sciece Letters homepage: www.growigsciece.com/msl A applicatio of data evelopmet aalysis for measurig the relative efficiecy

More information

2014 Gold Award Winner SpecialParent

2014 Gold Award Winner SpecialParent Award Wier SpecialParet Dedicated to all families of childre with special eeds 6 th Editio/Fall/Witer 2014 Desig ad Editorial Awards Competitio MISSION Our goal is to provide parets of childre with special

More information

VISION, MISSION, VALUES, AND GOALS

VISION, MISSION, VALUES, AND GOALS 6 VISION, MISSION, VALUES, AND GOALS 2010-2015 VISION STATEMENT Ohloe College will be kow throughout Califoria for our iclusiveess, iovatio, ad superior rates of studet success. MISSION STATEMENT The Missio

More information

*Net Perceptions, Inc West 78th Street Suite 300 Minneapolis, MN

*Net Perceptions, Inc West 78th Street Suite 300 Minneapolis, MN From: AAAI Technical Report WS-98-08. Compilation copyright 1998, AAAI (www.aaai.org). All rights reserved. Recommender Systems: A GroupLens Perspective Joseph A. Konstan *t, John Riedl *t, AI Borchers,

More information

On March 15, 2016, Governor Rick Snyder. Continuing Medical Education Becomes Mandatory in Michigan. in this issue... 3 Great Lakes Veterinary

On March 15, 2016, Governor Rick Snyder. Continuing Medical Education Becomes Mandatory in Michigan. in this issue... 3 Great Lakes Veterinary michiga veteriary medical associatio i this issue... 3 Great Lakes Veteriary Coferece 4 What You Need to Kow Whe Issuig a Iterstate Certificate of Ispectio 6 Low Pathogeic Avia Iflueza H5 Virus Detectios

More information

also inside Continuing Education Alumni Authors College Events

also inside Continuing Education Alumni Authors College Events SUMMER 2016 JAMESTOWN COMMUNITY COLLEGE ALUMNI MAGAZINE create a etrepreeur creatig a busiess a artist creatig beauty a citize creatig the future also iside Cotiuig Educatio Alumi Authors College Evets

More information

Introduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition

Introduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition Introduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition Todd Holloway Two Lecture Series for B551 November 20 & 27, 2007 Indiana University Outline Introduction Bias and

More information

A Case Study: News Classification Based on Term Frequency

A Case Study: News Classification Based on Term Frequency A Case Study: News Classification Based on Term Frequency Petr Kroha Faculty of Computer Science University of Technology 09107 Chemnitz Germany kroha@informatik.tu-chemnitz.de Ricardo Baeza-Yates Center

More information

Preference Learning in Recommender Systems

Preference Learning in Recommender Systems Preference Learning in Recommender Systems Marco de Gemmis, Leo Iaquinta, Pasquale Lops, Cataldo Musto, Fedelucio Narducci, and Giovanni Semeraro Department of Computer Science University of Bari Aldo

More information

Learning Methods in Multilingual Speech Recognition

Learning Methods in Multilingual Speech Recognition Learning Methods in Multilingual Speech Recognition Hui Lin Department of Electrical Engineering University of Washington Seattle, WA 98125 linhui@u.washington.edu Li Deng, Jasha Droppo, Dong Yu, and Alex

More information

OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS

OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS Václav Kocian, Eva Volná, Michal Janošek, Martin Kotyrba University of Ostrava Department of Informatics and Computers Dvořákova 7,

More information

How to read a Paper ISMLL. Dr. Josif Grabocka, Carlotta Schatten

How to read a Paper ISMLL. Dr. Josif Grabocka, Carlotta Schatten How to read a Paper ISMLL Dr. Josif Grabocka, Carlotta Schatten Hildesheim, April 2017 1 / 30 Outline How to read a paper Finding additional material Hildesheim, April 2017 2 / 30 How to read a paper How

More information

Lecture 1: Machine Learning Basics

Lecture 1: Machine Learning Basics 1/69 Lecture 1: Machine Learning Basics Ali Harakeh University of Waterloo WAVE Lab ali.harakeh@uwaterloo.ca May 1, 2017 2/69 Overview 1 Learning Algorithms 2 Capacity, Overfitting, and Underfitting 3

More information

Organizational Knowledge Distribution: An Experimental Evaluation

Organizational Knowledge Distribution: An Experimental Evaluation Association for Information Systems AIS Electronic Library (AISeL) AMCIS 24 Proceedings Americas Conference on Information Systems (AMCIS) 12-31-24 : An Experimental Evaluation Surendra Sarnikar University

More information

On-Line Data Analytics

On-Line Data Analytics International Journal of Computer Applications in Engineering Sciences [VOL I, ISSUE III, SEPTEMBER 2011] [ISSN: 2231-4946] On-Line Data Analytics Yugandhar Vemulapalli #, Devarapalli Raghu *, Raja Jacob

More information

Exploration. CS : Deep Reinforcement Learning Sergey Levine

Exploration. CS : Deep Reinforcement Learning Sergey Levine Exploration CS 294-112: Deep Reinforcement Learning Sergey Levine Class Notes 1. Homework 4 due on Wednesday 2. Project proposal feedback sent Today s Lecture 1. What is exploration? Why is it a problem?

More information

How do we balance statistical evidence with expert judgement when aligning tests to the CEFR?

How do we balance statistical evidence with expert judgement when aligning tests to the CEFR? How do we balance statistical evidence with expert judgement when aligning tests to the CEFR? Professor Anthony Green CRELLA University of Bedfordshire Colin Finnerty Senior Assessment Manager Oxford University

More information

The Good Judgment Project: A large scale test of different methods of combining expert predictions

The Good Judgment Project: A large scale test of different methods of combining expert predictions The Good Judgment Project: A large scale test of different methods of combining expert predictions Lyle Ungar, Barb Mellors, Jon Baron, Phil Tetlock, Jaime Ramos, Sam Swift The University of Pennsylvania

More information

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should

More information

Web as Corpus. Corpus Linguistics. Web as Corpus 1 / 1. Corpus Linguistics. Web as Corpus. web.pl 3 / 1. Sketch Engine. Corpus Linguistics

Web as Corpus. Corpus Linguistics. Web as Corpus 1 / 1. Corpus Linguistics. Web as Corpus. web.pl 3 / 1. Sketch Engine. Corpus Linguistics (L615) Markus Dickinson Department of Linguistics, Indiana University Spring 2013 The web provides new opportunities for gathering data Viable source of disposable corpora, built ad hoc for specific purposes

More information

Machine Learning and Development Policy

Machine Learning and Development Policy Machine Learning and Development Policy Sendhil Mullainathan (joint papers with Jon Kleinberg, Himabindu Lakkaraju, Jure Leskovec, Jens Ludwig, Ziad Obermeyer) Magic? Hard not to be wowed But what makes

More information

Assignment 1: Predicting Amazon Review Ratings

Assignment 1: Predicting Amazon Review Ratings Assignment 1: Predicting Amazon Review Ratings 1 Dataset Analysis Richard Park r2park@acsmail.ucsd.edu February 23, 2015 The dataset selected for this assignment comes from the set of Amazon reviews for

More information

Lecture 10: Reinforcement Learning

Lecture 10: Reinforcement Learning Lecture 1: Reinforcement Learning Cognitive Systems II - Machine Learning SS 25 Part III: Learning Programs and Strategies Q Learning, Dynamic Programming Lecture 1: Reinforcement Learning p. Motivation

More information

Instructor: Mario D. Garrett, Ph.D. Phone: Office: Hepner Hall (HH) 100

Instructor: Mario D. Garrett, Ph.D.   Phone: Office: Hepner Hall (HH) 100 San Diego State University School of Social Work 610 COMPUTER APPLICATIONS FOR SOCIAL WORK PRACTICE Statistical Package for the Social Sciences Office: Hepner Hall (HH) 100 Instructor: Mario D. Garrett,

More information

OCR for Arabic using SIFT Descriptors With Online Failure Prediction

OCR for Arabic using SIFT Descriptors With Online Failure Prediction OCR for Arabic using SIFT Descriptors With Online Failure Prediction Andrey Stolyarenko, Nachum Dershowitz The Blavatnik School of Computer Science Tel Aviv University Tel Aviv, Israel Email: stloyare@tau.ac.il,

More information

The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X

The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, 2013 10.12753/2066-026X-13-154 DATA MINING SOLUTIONS FOR DETERMINING STUDENT'S PROFILE Adela BÂRA,

More information

Test Effort Estimation Using Neural Network

Test Effort Estimation Using Neural Network J. Software Engineering & Applications, 2010, 3: 331-340 doi:10.4236/jsea.2010.34038 Published Online April 2010 (http://www.scirp.org/journal/jsea) 331 Chintala Abhishek*, Veginati Pavan Kumar, Harish

More information

Artificial Neural Networks written examination

Artificial Neural Networks written examination 1 (8) Institutionen för informationsteknologi Olle Gällmo Universitetsadjunkt Adress: Lägerhyddsvägen 2 Box 337 751 05 Uppsala Artificial Neural Networks written examination Monday, May 15, 2006 9 00-14

More information

TU-E2090 Research Assignment in Operations Management and Services

TU-E2090 Research Assignment in Operations Management and Services Aalto University School of Science Operations and Service Management TU-E2090 Research Assignment in Operations Management and Services Version 2016-08-29 COURSE INSTRUCTOR: OFFICE HOURS: CONTACT: Saara

More information

Iterative Cross-Training: An Algorithm for Learning from Unlabeled Web Pages

Iterative Cross-Training: An Algorithm for Learning from Unlabeled Web Pages Iterative Cross-Training: An Algorithm for Learning from Unlabeled Web Pages Nuanwan Soonthornphisaj 1 and Boonserm Kijsirikul 2 Machine Intelligence and Knowledge Discovery Laboratory Department of Computer

More information

Machine Learning and Data Mining. Ensembles of Learners. Prof. Alexander Ihler

Machine Learning and Data Mining. Ensembles of Learners. Prof. Alexander Ihler Machine Learning and Data Mining Ensembles of Learners Prof. Alexander Ihler Ensemble methods Why learn one classifier when you can learn many? Ensemble: combine many predictors (Weighted) combina

More information

Feature-oriented vs. Needs-oriented Product Access for Non-Expert Online Shoppers

Feature-oriented vs. Needs-oriented Product Access for Non-Expert Online Shoppers Feature-oriented vs. Needs-oriented Product Access for Non-Expert Online Shoppers Daniel Felix 1, Christoph Niederberger 1, Patrick Steiger 2 & Markus Stolze 3 1 ETH Zurich, Technoparkstrasse 1, CH-8005

More information

Calibration of Confidence Measures in Speech Recognition

Calibration of Confidence Measures in Speech Recognition Submitted to IEEE Trans on Audio, Speech, and Language, July 2010 1 Calibration of Confidence Measures in Speech Recognition Dong Yu, Senior Member, IEEE, Jinyu Li, Member, IEEE, Li Deng, Fellow, IEEE

More information

Rule Learning With Negation: Issues Regarding Effectiveness

Rule Learning With Negation: Issues Regarding Effectiveness Rule Learning With Negation: Issues Regarding Effectiveness S. Chua, F. Coenen, G. Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX Liverpool, United

More information

Software Maintenance

Software Maintenance 1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories

More information

Reinforcement Learning by Comparing Immediate Reward

Reinforcement Learning by Comparing Immediate Reward Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate

More information

Using Web Searches on Important Words to Create Background Sets for LSI Classification

Using Web Searches on Important Words to Create Background Sets for LSI Classification Using Web Searches on Important Words to Create Background Sets for LSI Classification Sarah Zelikovitz and Marina Kogan College of Staten Island of CUNY 2800 Victory Blvd Staten Island, NY 11314 Abstract

More information

Matching Similarity for Keyword-Based Clustering

Matching Similarity for Keyword-Based Clustering Matching Similarity for Keyword-Based Clustering Mohammad Rezaei and Pasi Fränti University of Eastern Finland {rezaei,franti}@cs.uef.fi Abstract. Semantic clustering of objects such as documents, web

More information

Learning From the Past with Experiment Databases

Learning From the Past with Experiment Databases Learning From the Past with Experiment Databases Joaquin Vanschoren 1, Bernhard Pfahringer 2, and Geoff Holmes 2 1 Computer Science Dept., K.U.Leuven, Leuven, Belgium 2 Computer Science Dept., University

More information

Curriculum Design Project with Virtual Manipulatives. Gwenanne Salkind. George Mason University EDCI 856. Dr. Patricia Moyer-Packenham

Curriculum Design Project with Virtual Manipulatives. Gwenanne Salkind. George Mason University EDCI 856. Dr. Patricia Moyer-Packenham Curriculum Design Project with Virtual Manipulatives Gwenanne Salkind George Mason University EDCI 856 Dr. Patricia Moyer-Packenham Spring 2006 Curriculum Design Project with Virtual Manipulatives Table

More information

Given a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations

Given a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations 4 Interior point algorithms for network ow problems Mauricio G.C. Resende AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 USA Panos M. Pardalos The University of Florida, Gainesville, FL 32611-6595

More information

Theory of Probability

Theory of Probability Theory of Probability Class code MATH-UA 9233-001 Instructor Details Prof. David Larman Room 806,25 Gordon Street (UCL Mathematics Department). Class Details Fall 2013 Thursdays 1:30-4-30 Location to be

More information

SARDNET: A Self-Organizing Feature Map for Sequences

SARDNET: A Self-Organizing Feature Map for Sequences SARDNET: A Self-Organizing Feature Map for Sequences Daniel L. James and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 dljames,risto~cs.utexas.edu

More information

16.1 Lesson: Putting it into practice - isikhnas

16.1 Lesson: Putting it into practice - isikhnas BAB 16 Module: Using QGIS in animal health The purpose of this module is to show how QGIS can be used to assist in animal health scenarios. In order to do this, you will have needed to study, and be familiar

More information

South Carolina English Language Arts

South Carolina English Language Arts South Carolina English Language Arts A S O F J U N E 2 0, 2 0 1 0, T H I S S TAT E H A D A D O P T E D T H E CO M M O N CO R E S TAT E S TA N DA R D S. DOCUMENTS REVIEWED South Carolina Academic Content

More information

Python Machine Learning

Python Machine Learning Python Machine Learning Unlock deeper insights into machine learning with this vital guide to cuttingedge predictive analytics Sebastian Raschka [ PUBLISHING 1 open source I community experience distilled

More information

6 Financial Aid Information

6 Financial Aid Information 6 This chapter includes information regarding the Financial Aid area of the CA program, including: Accessing Student-Athlete Information regarding the Financial Aid screen (e.g., adding financial aid information,

More information

Writing Research Articles

Writing Research Articles Marek J. Druzdzel with minor additions from Peter Brusilovsky University of Pittsburgh School of Information Sciences and Intelligent Systems Program marek@sis.pitt.edu http://www.pitt.edu/~druzdzel Overview

More information

Lecture 1: Basic Concepts of Machine Learning

Lecture 1: Basic Concepts of Machine Learning Lecture 1: Basic Concepts of Machine Learning Cognitive Systems - Machine Learning Ute Schmid (lecture) Johannes Rabold (practice) Based on slides prepared March 2005 by Maximilian Röglinger, updated 2010

More information

Australian Journal of Basic and Applied Sciences

Australian Journal of Basic and Applied Sciences AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com Feature Selection Technique Using Principal Component Analysis For Improving Fuzzy C-Mean

More information

GACE Computer Science Assessment Test at a Glance

GACE Computer Science Assessment Test at a Glance GACE Computer Science Assessment Test at a Glance Updated May 2017 See the GACE Computer Science Assessment Study Companion for practice questions and preparation resources. Assessment Name Computer Science

More information

stateorvalue to each variable in a given set. We use p(x = xjy = y) (or p(xjy) as a shorthand) to denote the probability that X = x given Y = y. We al

stateorvalue to each variable in a given set. We use p(x = xjy = y) (or p(xjy) as a shorthand) to denote the probability that X = x given Y = y. We al Dependency Networks for Collaborative Filtering and Data Visualization David Heckerman, David Maxwell Chickering, Christopher Meek, Robert Rounthwaite, Carl Kadie Microsoft Research Redmond WA 98052-6399

More information

Word Segmentation of Off-line Handwritten Documents

Word Segmentation of Off-line Handwritten Documents Word Segmentation of Off-line Handwritten Documents Chen Huang and Sargur N. Srihari {chuang5, srihari}@cedar.buffalo.edu Center of Excellence for Document Analysis and Recognition (CEDAR), Department

More information

AGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS

AGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS AGS THE GREAT REVIEW GAME FOR PRE-ALGEBRA (CD) CORRELATED TO CALIFORNIA CONTENT STANDARDS 1 CALIFORNIA CONTENT STANDARDS: Chapter 1 ALGEBRA AND WHOLE NUMBERS Algebra and Functions 1.4 Students use algebraic

More information

Netpix: A Method of Feature Selection Leading. to Accurate Sentiment-Based Classification Models

Netpix: A Method of Feature Selection Leading. to Accurate Sentiment-Based Classification Models Netpix: A Method of Feature Selection Leading to Accurate Sentiment-Based Classification Models 1 Netpix: A Method of Feature Selection Leading to Accurate Sentiment-Based Classification Models James B.

More information

Testing A Moving Target: How Do We Test Machine Learning Systems? Peter Varhol Technology Strategy Research, USA

Testing A Moving Target: How Do We Test Machine Learning Systems? Peter Varhol Technology Strategy Research, USA Testing A Moving Target: How Do We Test Machine Learning Systems? Peter Varhol Technology Strategy Research, USA Testing a Moving Target How Do We Test Machine Learning Systems? Peter Varhol, Technology

More information

Grade 6: Correlated to AGS Basic Math Skills

Grade 6: Correlated to AGS Basic Math Skills Grade 6: Correlated to AGS Basic Math Skills Grade 6: Standard 1 Number Sense Students compare and order positive and negative integers, decimals, fractions, and mixed numbers. They find multiples and

More information

Algebra 2- Semester 2 Review

Algebra 2- Semester 2 Review Name Block Date Algebra 2- Semester 2 Review Non-Calculator 5.4 1. Consider the function f x 1 x 2. a) Describe the transformation of the graph of y 1 x. b) Identify the asymptotes. c) What is the domain

More information

AQUA: An Ontology-Driven Question Answering System

AQUA: An Ontology-Driven Question Answering System AQUA: An Ontology-Driven Question Answering System Maria Vargas-Vera, Enrico Motta and John Domingue Knowledge Media Institute (KMI) The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom.

More information

What is beautiful is useful visual appeal and expected information quality

What is beautiful is useful visual appeal and expected information quality What is beautiful is useful visual appeal and expected information quality Thea van der Geest University of Twente T.m.vandergeest@utwente.nl Raymond van Dongelen Noordelijke Hogeschool Leeuwarden Dongelen@nhl.nl

More information

Introduction of Open-Source e-learning Environment and Resources: A Novel Approach for Secondary Schools in Tanzania

Introduction of Open-Source e-learning Environment and Resources: A Novel Approach for Secondary Schools in Tanzania Introduction of Open-Source e- Environment and Resources: A Novel Approach for Secondary Schools in Tanzania S. K. Lujara, M. M. Kissaka, L. Trojer and N. H. Mvungi Abstract The concept of e- is now emerging

More information

Measures of the Location of the Data

Measures of the Location of the Data OpenStax-CNX module m46930 1 Measures of the Location of the Data OpenStax College This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3.0 The common measures

More information

Mathematics process categories

Mathematics process categories Mathematics process categories All of the UK curricula define multiple categories of mathematical proficiency that require students to be able to use and apply mathematics, beyond simple recall of facts

More information

GCSE Mathematics B (Linear) Mark Scheme for November Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education

GCSE Mathematics B (Linear) Mark Scheme for November Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education GCSE Mathematics B (Linear) Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education Mark Scheme for November 2014 Oxford Cambridge and RSA Examinations OCR (Oxford Cambridge

More information

THEORY OF PLANNED BEHAVIOR MODEL IN ELECTRONIC LEARNING: A PILOT STUDY

THEORY OF PLANNED BEHAVIOR MODEL IN ELECTRONIC LEARNING: A PILOT STUDY THEORY OF PLANNED BEHAVIOR MODEL IN ELECTRONIC LEARNING: A PILOT STUDY William Barnett, University of Louisiana Monroe, barnett@ulm.edu Adrien Presley, Truman State University, apresley@truman.edu ABSTRACT

More information

DERMATOLOGY. Sponsored by the NYU Post-Graduate Medical School. 129 Years of Continuing Medical Education

DERMATOLOGY. Sponsored by the NYU Post-Graduate Medical School. 129 Years of Continuing Medical Education Advaces i DERMATOLOGY THURSDAY - FRIDAY JUNE 7-8, 2012 New York, NY Sposored by the NYU Post-Graduate Medical School 129 Years of Cotiuig Medical Educatio THE RONALD O. PERELMAN DEPARTMENT OF DERMATOLOGY

More information

Seminar - Organic Computing

Seminar - Organic Computing Seminar - Organic Computing Self-Organisation of OC-Systems Markus Franke 25.01.2006 Typeset by FoilTEX Timetable 1. Overview 2. Characteristics of SO-Systems 3. Concern with Nature 4. Design-Concepts

More information

This scope and sequence assumes 160 days for instruction, divided among 15 units.

This scope and sequence assumes 160 days for instruction, divided among 15 units. In previous grades, students learned strategies for multiplication and division, developed understanding of structure of the place value system, and applied understanding of fractions to addition and subtraction

More information

Chinese Language Parsing with Maximum-Entropy-Inspired Parser

Chinese Language Parsing with Maximum-Entropy-Inspired Parser Chinese Language Parsing with Maximum-Entropy-Inspired Parser Heng Lian Brown University Abstract The Chinese language has many special characteristics that make parsing difficult. The performance of state-of-the-art

More information

Learning to Rank with Selection Bias in Personal Search

Learning to Rank with Selection Bias in Personal Search Learning to Rank with Selection Bias in Personal Search Xuanhui Wang, Michael Bendersky, Donald Metzler, Marc Najork Google Inc. Mountain View, CA 94043 {xuanhui, bemike, metzler, najork}@google.com ABSTRACT

More information

University of Groningen. Systemen, planning, netwerken Bosman, Aart

University of Groningen. Systemen, planning, netwerken Bosman, Aart University of Groningen Systemen, planning, netwerken Bosman, Aart IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document

More information

Proof Theory for Syntacticians

Proof Theory for Syntacticians Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 5, 2012 Logics for Linguistics Many different kinds of logic are directly applicable to formalizing theories in syntax

More information

Axiom 2013 Team Description Paper

Axiom 2013 Team Description Paper Axiom 2013 Team Description Paper Mohammad Ghazanfari, S Omid Shirkhorshidi, Farbod Samsamipour, Hossein Rahmatizadeh Zagheli, Mohammad Mahdavi, Payam Mohajeri, S Abbas Alamolhoda Robotics Scientific Association

More information

Probabilistic Latent Semantic Analysis

Probabilistic Latent Semantic Analysis Probabilistic Latent Semantic Analysis Thomas Hofmann Presentation by Ioannis Pavlopoulos & Andreas Damianou for the course of Data Mining & Exploration 1 Outline Latent Semantic Analysis o Need o Overview

More information

The lab is designed to remind you how to work with scientific data (including dealing with uncertainty) and to review experimental design.

The lab is designed to remind you how to work with scientific data (including dealing with uncertainty) and to review experimental design. Name: Partner(s): Lab #1 The Scientific Method Due 6/25 Objective The lab is designed to remind you how to work with scientific data (including dealing with uncertainty) and to review experimental design.

More information

A Comparison of Two Text Representations for Sentiment Analysis

A Comparison of Two Text Representations for Sentiment Analysis 010 International Conference on Computer Application and System Modeling (ICCASM 010) A Comparison of Two Text Representations for Sentiment Analysis Jianxiong Wang School of Computer Science & Educational

More information

COMPUTER-ASSISTED INDEPENDENT STUDY IN MULTIVARIATE CALCULUS

COMPUTER-ASSISTED INDEPENDENT STUDY IN MULTIVARIATE CALCULUS COMPUTER-ASSISTED INDEPENDENT STUDY IN MULTIVARIATE CALCULUS L. Descalço 1, Paula Carvalho 1, J.P. Cruz 1, Paula Oliveira 1, Dina Seabra 2 1 Departamento de Matemática, Universidade de Aveiro (PORTUGAL)

More information

Conversation Starters: Using Spatial Context to Initiate Dialogue in First Person Perspective Games

Conversation Starters: Using Spatial Context to Initiate Dialogue in First Person Perspective Games Conversation Starters: Using Spatial Context to Initiate Dialogue in First Person Perspective Games David B. Christian, Mark O. Riedl and R. Michael Young Liquid Narrative Group Computer Science Department

More information

Trust and Community: Continued Engagement in Second Life

Trust and Community: Continued Engagement in Second Life Trust and Community: Continued Engagement in Second Life Peyina Lin pl3@uw.edu Natascha Karlova nkarlova@uw.edu John Marino marinoj@uw.edu Michael Eisenberg mbe@uw.edu Information School, University of

More information

A Process-Model Account of Task Interruption and Resumption: When Does Encoding of the Problem State Occur?

A Process-Model Account of Task Interruption and Resumption: When Does Encoding of the Problem State Occur? A Process-Model Account of Task Interruption and Resumption: When Does Encoding of the Problem State Occur? Dario D. Salvucci Drexel University Philadelphia, PA Christopher A. Monk George Mason University

More information

Generative models and adversarial training

Generative models and adversarial training Day 4 Lecture 1 Generative models and adversarial training Kevin McGuinness kevin.mcguinness@dcu.ie Research Fellow Insight Centre for Data Analytics Dublin City University What is a generative model?

More information

Dublin City Schools Mathematics Graded Course of Study GRADE 4

Dublin City Schools Mathematics Graded Course of Study GRADE 4 I. Content Standard: Number, Number Sense and Operations Standard Students demonstrate number sense, including an understanding of number systems and reasonable estimates using paper and pencil, technology-supported

More information

Detecting Wikipedia Vandalism using Machine Learning Notebook for PAN at CLEF 2011

Detecting Wikipedia Vandalism using Machine Learning Notebook for PAN at CLEF 2011 Detecting Wikipedia Vandalism using Machine Learning Notebook for PAN at CLEF 2011 Cristian-Alexandru Drăgușanu, Marina Cufliuc, Adrian Iftene UAIC: Faculty of Computer Science, Alexandru Ioan Cuza University,

More information

SETTING STANDARDS FOR CRITERION- REFERENCED MEASUREMENT

SETTING STANDARDS FOR CRITERION- REFERENCED MEASUREMENT SETTING STANDARDS FOR CRITERION- REFERENCED MEASUREMENT By: Dr. MAHMOUD M. GHANDOUR QATAR UNIVERSITY Improving human resources is the responsibility of the educational system in many societies. The outputs

More information

On Human Computer Interaction, HCI. Dr. Saif al Zahir Electrical and Computer Engineering Department UBC

On Human Computer Interaction, HCI. Dr. Saif al Zahir Electrical and Computer Engineering Department UBC On Human Computer Interaction, HCI Dr. Saif al Zahir Electrical and Computer Engineering Department UBC Human Computer Interaction HCI HCI is the study of people, computer technology, and the ways these

More information

Universidade do Minho Escola de Engenharia

Universidade do Minho Escola de Engenharia Universidade do Minho Escola de Engenharia Universidade do Minho Escola de Engenharia Dissertação de Mestrado Knowledge Discovery is the nontrivial extraction of implicit, previously unknown, and potentially

More information

Practice Examination IREB

Practice Examination IREB IREB Examination Requirements Engineering Advanced Level Elicitation and Consolidation Practice Examination Questionnaire: Set_EN_2013_Public_1.2 Syllabus: Version 1.0 Passed Failed Total number of points

More information

Centre for Evaluation & Monitoring SOSCA. Feedback Information

Centre for Evaluation & Monitoring SOSCA. Feedback Information Centre for Evaluation & Monitoring SOSCA Feedback Information Contents Contents About SOSCA... 3 SOSCA Feedback... 3 1. Assessment Feedback... 4 2. Predictions and Chances Graph Software... 7 3. Value

More information

SELF-STUDY QUESTIONNAIRE FOR REVIEW of the COMPUTER SCIENCE PROGRAM

SELF-STUDY QUESTIONNAIRE FOR REVIEW of the COMPUTER SCIENCE PROGRAM Disclaimer: This Self Study was developed to meet the goals of the CAC Session at the 2006 Summit. It should not be considered as a model or a template. ABET Computing Accreditation Commission SELF-STUDY

More information

Learning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models

Learning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models Learning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models Stephan Gouws and GJ van Rooyen MIH Medialab, Stellenbosch University SOUTH AFRICA {stephan,gvrooyen}@ml.sun.ac.za

More information