Using Content-Based Filtering for Recommendation 1

Size: px
Start display at page:

Download "Using Content-Based Filtering for Recommendation 1"

Transcription

1 Usng Content-Based Flterng for Recommendaton 1 Robn van Meteren 1 and Maarten van Someren 2 1 NetlnQ Group, Gerard Brandtstraat 26-28, 1054 JK, Amsterdam, The Netherlands, [email protected] 2 Unversty of Amsterdam, Roeterstraat 18, The Netherlands, [email protected] Abstract Fndng nformaton on a large web ste can be a dffcult and tme-consumng process. Recommender systems can help users fnd nformaton by provdng them wth personalzed suggestons. In ths paper the recommender system PRES s descrbed that uses content-based flterng technques to suggest small artcles about home mprovements. A doman such as ths mplcates that the user model has to be very dynamc and learned from postve feedbac only. The relevance feedbac method seems to be a good canddate for learnng such a user model, as t s both effcent and dynamc. 1 Introducton As the World Wde Web contnues to grow at an exponental rate, the sze and complexty of many web stes grow along wth t. For the users of these web stes t becomes ncreasngly dffcult and tme consumng to fnd the nformaton they are loong for. To help users fnd the nformaton that s n accordance wth ther nterests a web ste can be personalzed. Recommender systems can mprove a web ste for ndvdual users by dynamcally addng hyperlns. In ths paper the recommender system PRES (acronym for Personalzed Recommender System) s ntroduced. PRES creates dynamc hyperlns for a web ste that contans a collecton of advses about do t yourself home mprovement. The purpose of these dynamc hyperlns s to mae t easer for a user to fnd nterestng tems and thus mprovng the nteracton between the system and the user. When users browse through a web ste they are usually loong for tems they fnd nterestng. Interest tems can consst of a number of thngs. For example, textual nformaton can be consdered as nterest tems or an ndex on a certan topc could be the tem a user s loong for. Another example, applcable for a web vendor, s to consder purchased products as nterest tems. Whatever the tems consst of, a web ste can be seen as a collecton of these nterest tems. Every large collecton needs a certan structure to mae t easy for vstors to fnd what they are loong for. A web ste can be structured by dvdng ts web pages nto content pages and navgaton pages. The content pages provde the user wth the nterest tems whle the navgaton pages help the user to search for the nterest tems. Ths s not a strct classfcaton however. Pages can also be hybrd n the sense that they both provde content as well as navgaton facltes. Furthermore, what s a navgaton page for one user may be a content page to another and vsa versa. In general however, ths classfcaton provdes a way of descrbng the structure of a web ste and how ths structure can be mproved for ndvdual users by dynamcally addng hyperlns. 1 Ths research has been supported by NetlnQ

2 - Content Page - Navgaton Page - Hybrd Page - Hypertext Ln Fgure 1 Structure of sample web ste Fgure 1 shows an example of a web ste wth a typcal tree structure. The content pages are found at the bottom of the tree whle the navgaton pages are found at the top. A recommender system can dsplay ts recommendatons by dynamcally creatng hypertext lns to content pages that contan the tems a user mght be nterested n. Several factors determne whether or not a recommended page should be lned to the page that s shown to the user. Sometmes content pages are only recommended f they contan tems that are smlar to the tem(s) shown on the current page. Another consderaton for dynamc lnng s the proxmty to the recommended page. The dstance between two pages s determned by the mnmal number of lns t taes to navgate from one page to another. There s not much use of lnng the current page to a recommended page f the dstance between the two pages s 1. The further the dstance, the more useful a dynamcally created ln becomes. 2 Content-based flterng Recommender systems are a specal type of nformaton flterng systems. Informaton flterng deals wth the delvery of tems selected from a large collecton that the user s lely to fnd nterestng or useful and can be seen as a classfcaton tas. Based on tranng data a user model s nduced that enables the flterng system to classfy unseen tems nto a postve class c (relevant to the user) or a negatve class c (rrelevant to the user). The tranng set conssts of the tems that the user found nterestng. These tems form tranng nstances that all have an attrbute. Ths attrbute specfes the class of the tem based on ether the ratng of the user or on mplct evdence. Formally, an tem s descrbed as a vector X = ( x, 1 x2,..., x n ) of n components. The components can have bnary, nomnal or numercal attrbutes and are derved from ether the content of the tems or from nformaton about the users preferences. The tas of the learnng method s to select a functon based on a tranng set of m nput vectors that can classfy any tem n the collecton. The functon h ( X ) wll ether be able to classfy an unseen tem as postve or negatve at once by returnng a bnary value or return a numercal value. In that case a threshold can be used to determne f the tem s relevant or rrelevant to the user.

3 A content-based flterng system selects tems based on the correlaton between the content of the tems and the user s preferences as opposed to a collaboratve flterng system that chooses tems based on the correlaton between people wth smlar preferences. PRES s a content-based flterng system. It maes recommendatons by comparng a user profle wth the content of each document n the collecton. The content of a document can be represented wth a set of terms. Terms are extracted from documents by runnng through a number of parsng steps. Frst all HTML tags and stop words (words that occur very often and cannot be used as dscrmnators) are removed. The remanng words are reduced to ther stem by removng prefxes and suffxes [Porter 1980]. For nstance the words computer, computers and computng could all be reduced to comput. The user profle s represented wth the same terms and bult up by analyzng the content of documents that the user found nterestng. Whch documents the user found nterestng can be determned by usng ether explct or mplct feedbac. Explct feedbac requres the user to evaluate examned documents on a scale. In mplct feedbac the user s nterests are nferred by observng the user s actons, whch s more convenent for the user but more dffcult to mplement. There are several ways n whch terms can be represented n order to be used as a bass for the learnng component. A representaton method that s often used s the vector space model. In the vector space model a document D s represented as an m- dmensonal vector, where each dmenson corresponds to a dstnct term and m s the total number of terms used n the collecton of documents. The document vector s wrtten as, where w s the weght of term t that ndcates ts mportance. If document D does not contan term t then weght w s zero. Term weghts can be determned by usng the tf-df scheme. In ths approach the terms are assgned a weght that s based on how often a term appears n a partcular document and how frequently t occurs n the entre document collecton: w = tf log n df where tf s the number of occurrences of term t n document D, n the total number of documents n the collecton and df the number of documents n whch term t appears at least once. The assumptons behnd tf-df are based on two characterstcs of text documents. Frst, the more tmes a term appears n a document, the more relevant t s to the topc of the document. Second, the more tmes a term occurs n all documents n the collecton, the more poorly t dscrmnates between documents. In the vector space model user profles can be represented just le documents by one or more profle vectors. The degree of smlarty between a profle vector P, where P = u,..., u ) can be determned by usng the cosne measure: ( 1 sm( D, P) = D P D P = u u 2 w w 2

4 3 PRES Document Collecton Recommender Web Page nteracton User Profle feedbac User Fgure 2 The PRES archtecture Fgure 2 shows the PRES archtecture. A user profle s learned from feedbac provded by the user. The recommender system compares the user profle wth the documents n the collecton. The documents are then raned on the bass of certan crtera such as smlarty, novelty, proxmty and relevancy and the best raned documents appear as hyperlns on the current web page. 3.1 Doman characterstcs As stated earler, PRES recommends documents that consst of textual nformaton about do t yourself home mprovements. The most mportant aspect of ths type of nformaton s the fact that a certan topc s only nterestng to a user for a short perod of tme. Once an mprovement has been carred out or enough nformaton has been provded the user wll lose nterest n that topc. As a consequence the user model that PRES learns has to be very dynamc. A doman n whch users nterests change qucly also has mplcatons for how the feedbac s acqured. Explct feedbac s not a good choce for two reasons. Users wll have to rate tems frequently and wll be very reluctant n dong so as ther ratngs expre qucly. Acqurng feedbac by observng the users actons s therefore favorable. A user that selects and reads a document for a certan amount of tme provdes a strong ndcaton that the document contans nformaton a user s nterested n. After such acton the documents s therefore classfed as a postve example. Fndng negatve examples s much more problematc. Users gnorng lns to documents could be seen as a clue. Ths acton does not provde strong evdence however as users mght not have notced the ln or vst the document later. Another possble clue s a document that s beng read for a very short tme but ths could be caused by the fact that the document s smlar to what the user has already seen although the topc of the document s stll nterestng to the user. Classfyng documents as negatve based on wea assumptons leads to much nose n the tranng data and may result n naccurate predctons. Negatve examples wll therefore not be used. In short, the user model has to be dynamc and learned from postve examples only.

5 3.2 Learnng algorthm There exst a varety of machne learnng methods that can be used for learnng a user model. PRES employs the relevance feedbac method because t s both effcent and dynamc. Relevance feedbac was ntroduced by Roccho as an nformaton retreval utlty that mplements retreval n several passes but t can also be appled to nformaton flterng. Documents and profles are represented as vectors n the vector space model. The term weghts of a document are calculated usng the standard tf-df scheme. The profle conssts of one vector that represents a topc of nterest. In several nformaton flterng systems that use relevance feedbac the profle consst of more than one vector. For example, WebMate [Chen & Sycara 1997] a personal agent that helps users browse the web, uses clusterng to mantan several profle vectors that each represent a dfferent topc. The problem wth usng more than one vector s that t taes a whle before a vector wll represent a topc accurately enough. A document about a certan topc wll therefore not always be assgned to a profle vector about the same topc. Because PRES operates n an envronment n whch the topc nterest of users changes constantly only one vector s used. Ths vector s ntally empty and s adjusted as the user navgates through the web ste. When a user has spent a certan amount of tme readng a document D the user profle P s updated wth the followng equaton: P' = α P + βd Note that f the document or the profle does not contan a term the correspondng weght s zero. Terms n the profle that have very low weghts are removed after the profle vector has been updated. Weght β determnes the relatve mportance of a document to the user. In nformaton flterng systems that rely on explct feedbac β usually corresponds to the ratng a user has gven to a document and can ether be a postve or a negatve value. Systems that use mplct feedbac may use dfferent values for β for dfferent nds of feedbac. In the recommender system Slder [Balabanovc 1998] for example, β s set to 3 when a user has deleted an artcle and to 0.5 when a users has read an artcle. Because PRES only determnes whether or not a document s relevant, weght β s always set to 1. The profle vector s adjusted to a dmnshng of the user s nterests by α, a weght between 0 and 1 that reduces the term weghts n the profle. Ths weght s determned va expermentaton. Besdes the profle vector, a user profle also contans nformaton about whch pages the user has vsted and the current page. All ths nformaton s necessary to generate recommendatons that appear as hyperlns on web pages. Several factors can be consdered n determnng whch documents should be suggested to the user: The smlarty between a document vector and the profle vector can be calculated usng several smlarty measurements. The novelty of a document s determned by the exstence of nformaton n a document that s new to the user. The proxmty of a document s determned by the mnmal number of lns t taes to navgate from the current page to a page that presents the document. Mobasher et al. [Mobasher et al. 1999b] for example tae the log of the number of lns as a measurement of dstance. Some recommender systems also chec f a document s relevant to the nformaton shown on the current page.

6 In PRES the smlarty between the profle vector and a document s determned by usng the cosne measurement. Documents that have already been vsted by the user or already appear as hyperlns on the current page are fltered out. The remanng documents are then sorted by ran. Two dfferent strateges for determnng whch of these documents appear as hyperlns were examned. In the frst approach only a fxed number of top raned documents are suggested. In the second approach documents are suggested f ther score s above a relevance threshold [Yan & Garca- Molna 1994]. 3.3 Implementaton PRES has been largely wrtten n the object-orented programmng language Java. Java s often used to mae applets that run on clent machnes. Clent-sde Java has several lmtatons however. In order to run applets the clent machne has to support Java. Although ths s a standard feature n most browsers, many of them also have the opton to dsable applets. It also taes a consderable amount of tme to load the applet on the clent machne and for the applet to request or receve data from the server machne. PRES does not mae use of applets but runs entrely on the serversde by usng Java servlets and Java server pages (JSP). A servlet s a Java class that expands the functonalty of a server. Because servlets operate solely wthn the doman of a server they do not have the lmtatons that applets mpose. Java server pages are fles that contan both HTML and embedded Java code. JSP fles are compled to servlets by a servlet engne that also runs the servlets. PRES uses the servlet engne of JRun that functons as a plug-n to an exstng server. Ths means that the servlets run ndependently from the web server. The advantage of an add-on servlet engne s that f the server changes, the same servlet engne can stll be used and hence no alteratons have to made to the servlet code. In many servers that support servlets a request for a JSP fle s handled by a specal servlet. Usually ths servlet can be replaced by another servlet or by a sequence of servlets. The request s then sent to the frst servlet n the chan whle the response from the last servlet s sent bac to the browser. In between the output of each servlet s passed to the next servlet. Ths technque s called servlet channg and can be used to place a specal servlet behnd the servlet that normally handles JSP fles so that t s called upon every tme a user request a JSP fle. Ths servlet carres out the relevance feedbac method by updatng the user profle wth the terms of the JSP fle. It also replaces a predefned tag that could be ncluded n the JSP fle wth personalzed recommendatons. The archtecture of the PRES mplementaton s shown n fgure 3. The database contans two dfferent types of data: Informaton about users and nformaton about web pages. The nformaton about users s obtaned onlne ether from users themselves or by observng ther behavor. The nformaton about web pages s gathered offlne, largely by the parser component whch s run every tme new pages are added to the web ste. It analyss the collecton of web pages and extracts terms and calculates ther tf-df weghts whch are then stored n the database. The profler and membershp component both react to user requests. The membershp component enables the user to become a member by creatng an account. Informaton that the users provde such as a unque user name and a password s stored n the database. A user needs to be a member n order to receve personalzed recommendatons. The

7 profler component eeps trac of the pages that members vst. It also carres out the relevance feedbac method for every member. All ths nformaton s stored n the user profle whch s ntally empty for new members. The recommender component tres to fnd relevant web pages by comparng the user Database User Profle Page Index Profler Recommender Membershp Parser Feedbac JSP fles Fgure 3 Archtecture of the PRES mplementaton profle wth the pages that were ndexed. Recommendatons are presented to the user by nsertng hyperlns nto the next JSP fle that the user requests. 4 Performance To evaluate PRES three fcttous users were created whch all had dfferent nterests. Two topcs about home mprovement were assgned to the frst user, three to the second user and four to the thrd user. For each topc all the relevant documents n the collecton were selected and classfed as relevant f t contaned nformaton that was assocated wth the topc. The percentage of documents that the users selected per topc also dffered. The frst user selected 80% of all the relevant documents about the two topcs, the second user 50% and the thrd user 30%. The tranng sessons were then processed just le a normal user sesson would have been. Fgure 4 shows the results of ths experment. From left to rght the precson (relevant retreved/retreved) and recall (relevant retreved/relevant) at dfferent ponts n tme are shown of the frst, second and thrd tranng sesson respectvely. The precson ratos dffer sgnfcantly for dfferent topcs of nterest. Ths s probably caused by the fact that documents about several topcs contan many dfferent terms whch maes t dffcult for the learnng method to fnd a relaton between these documents. Precson ratos also dffer at dfferent ponts n tme for the same topcs of nterest. As more documents about a certan topc are selected t becomes easer for a learnng method to mae

8 1 0,8 0,6 0,4 0,2 0 Precson Recall Fgure 4 Precson and recall for three recommendatons as t s provded wth more smlar terms. On the other hand, as more documents are selected the number of remanng documents that are relevant decreases and t therefore also becomes more dffcult for the learnng method to fnd other relevant documents. Ths last factor wll have lttle effect n the case of the thrd user sesson as only 30% of the total amount of documents about a topc are selected. In ths case, precson usually ncreases overtme. The exact effects however reman dffcult to measure as other factors, such as a page change, also have an nfluence on these ratos. 5 Related wor Many of the content-based flterng technques that were descrbed are borrowed from the feld of nformaton retreval. Content-based flterng however, dffers from nformaton retreval n the manner n whch the nterests of a user are represented. Instead of usng a query an nformaton flterng system tres to model the user s long term nterests. There are several other systems that use content-based flterng to help users fnd nformaton on the World Wde Web. Letza [Leberman 1995] s a user nterface that asssts users browsng the web. The system tracs the browsng behavor of a user and tres to antcpate what pages may be of nterest to the user. Sysll & Webert [Pazzan et al. 1996] s a software agent that tres to determne whch web pages mght nterest a user by usng a nave Bayesan classfer. A user provdes tranng nstances by ratng explored pages as ether hot or cold. Jennngs and Hguch [Jennngs & Hguch 1992] descrbe a neural networ that models the nterests of a user n a Usenet news envronment. The neural networ s formed and modfed as a result of the artcles a user has read or rejected. The wor presented n ths paper dffers from these systems by focusng on sngle web stes. Informaton flterng systems that personalze web stes often use a collaboratve approach to flterng. Amazon.com for example uses the GroupLens system [Resnc et al. 1994] to mae recommendatons about boos and vdeos. Mobasher et al. [Mobasher et al. 1999b] descrbe several mnng technques for personalzaton. User access logs are examned to dscover clusters of users that exhbt smlar browsng behavor. These clusters can be used to predct the browsng behavor of ndvdual users.

9 6 Conclusons The test results seem to ndcate that on average, slghtly more than one out of two of the suggestons that PRES maes s relevant. The results are negatvely nfluenced by the fact that the same concept can usually be descrbed wth several terms and many terms have more than one meanng. Ths maes the user profle less accurately, especally because the documents n the collecton are relatvely short and normally only a few documents about the same topc are selected by the user. Better results mght be obtaned by mprovng the vector space model. What content-based flterng systems cannot do however, s mae predctons about the future nterests of users. Collaboratve flterng systems can mae suggestons to a user that are outsde the scope of prevous selected tems. The effectveness of PRES can therefore be further mproved f content-based and collaboratve flterng would be combned. The menu structure also has a great nfluence on the effectveness of PRES. Because t s not useful to recommend tems that already appear n the current menu, t becomes more dffcult to mae recommendatons f the user has selected a menu that already contans most of the relevant tems. The average precson of the recommendatons that PRES maes drops about 15% f the menu s taen nto account. So n general, the better the web ste s organzed, the harder t wll be to mae recommendatons. Most web stes, especally larger ones, however can never be perfectly optmzed for all users. Users have dfferent nterests and personalzng a web ste could help them fnd nformaton faster as they otherwse would have or wouldn t have found at all. References [Armstrong et al. 1995] Armstrong, R., Fretag, D., Joachms, T. and Mtchell, T. (1995). WebWatcher: A learnng apprentce for the World Wde Web. In Proceedngs of AAAI Sprng Symposum on Informaton Gatherng, Standford, CA. [Atsum 1997] Atsum, M. (1997). Extracton of User s Interests from Web Pages based on Genetc Algorthm. IPSJ SIG Vol. 97 No. 51, pp [Balabanovc 1998] Balabanovc, M. (1998). An Interface for Learnng Mult-topc User Profles from Implct Feedbac. AAAI-98 Worshop on Recommender Systems, Madson, Wsconsn. [Balabanovc & Shoham 1995] Balabanovc, M. and Shoham, Y. (1995). Learnng Informaton Retreval Agents: Experments wth Automated Web Browsng. In Worng Notes of the AAAI Sprng Symposum Seres, pp Stanford Unversty. [Chen & Sycara 1998] Chen, L. and Sycara, K. (1998). WebMate: A Personal Agent for Browsng and Searchng. In Proceedngs of the 2nd Internatonal Conference on Autonomous Agents and Mult Agent Systems, Mnneapols, MN. [Jennngs & Hguch 1992] Jennngs, A. and Hguch, H. (1992). A Personal News Servce based on a User Model Neural Networ. IEICE Transactons on Informaton and Systems, Vol. E75-D, No. 2, pp [Leberman 1995] Leberman, H. (1995). Letza: An Agent that Asssts Web Browsng. In Proceedngs of the 1995 Internatonal Jont Conference on Artfcal Intellgence. Montreal, Canada. [Mobasher et al. 1999a] Mobasher, B., Cooley, R. and Srvastava, J. (1999). Data Preparaton for Mnng World Wde Web Browsng Patterns. Journal of Knowledge and Informaton Systems, Vol. 1, No. 1. [Mobasher et al. 1999b] Mobasher, B., Cooley, R. and Srvastava, J. (1999). Automatc Personalzaton Based on Web Usage Mnng. Techncal Report TR99-010, Department of Computer Scence, Depaul Unversty. [Nchols 1997] Nchols, D. M. (1997). Implct Ratng and Flterng. In Proceedngs of the Ffth DELOS Worshop on Flterng and Collaboratve Flterng, pp Budapest, Hungary.

10 [Nlsson 1996] Nlsson, N. J. (1996). Introducton to Machne Learnng. Unpublshed draft, Department of Computer Scence, Stanford Unversty. [Pazzan et al. 1996] Pazzan, M., Muramatsu, J. and Bllsus, D. (1996). Sysll & Webert: Identfyng nterestng web stes. In Proceedngs of the Thrteenth Natonal Conference on Artfcal Intellgence AAAI 96, pp [Porter 1980] Porter, M. (1980). An Algorthm for Suffx Strppng. Program, 14(3), pp [Resnc et al. 1994] Resnc, P., Iacovou, N., Sucha, M., Bergstrom, P. and Redl, J. (1994). GroupLens: An Open Archtecture for Collaboratve Flterng of Netnews. In Proceedngs of ACM 1994 Conference on Computer Supported Cooperatve Wor, Chapel Hll, NC, pp [Schwab & Pohl 1999] Schwab, I. and Pohl, W. (1999). Learnng User Profles from Postve Examples. In Proceedngs of the Internatonal Conference on Machne Learnng & Applcatons, pp Chana, Greece. [Yan & Garca-Molna 1994] Yan, T. W. and Garca-Molna, H. (1994) Index Structures for Informaton Flterng Under the Vector Space Model. In Proceedngs of the Internatonal Conference on Data Engneerng.

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna [email protected] Abstract.

More information

Dscusses and Recommendaton Systems

Dscusses and Recommendaton Systems 10 Content-based Recommendaton Systems Mchael J. Pazzan 1 and Danel Bllsus 2 1 Rutgers Unversty, ASBIII, 3 Rutgers Plaza New Brunswck, NJ 08901 [email protected] 2 FX Palo Alto Laboratory, Inc., 3400

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

A neuro-fuzzy collaborative filtering approach for Web recommendation. G. Castellano, A. M. Fanelli, and M. A. Torsello *

A neuro-fuzzy collaborative filtering approach for Web recommendation. G. Castellano, A. M. Fanelli, and M. A. Torsello * Internatonal Journal of Computatonal Scence 992-6669 (Prnt) 992-6677 (Onlne) Global Informaton Publsher 27, Vol., No., 27-39 A neuro-fuzzy collaboratve flterng approach for Web recommendaton G. Castellano,

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye [email protected] [email protected] [email protected] Abstract - Stock market s one of the most complcated systems

More information

Descriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications

Descriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble

More information

A DATA MINING APPLICATION IN A STUDENT DATABASE

A DATA MINING APPLICATION IN A STUDENT DATABASE JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul

More information

Context-aware Mobile Recommendation System Based on Context History

Context-aware Mobile Recommendation System Based on Context History TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.12, No.4, Aprl 2014, pp. 3158 ~ 3167 DOI: http://dx.do.org/10.11591/telkomnka.v124.4786 3158 Context-aware Moble Recommendaton System Based on Context

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

Traffic-light a stress test for life insurance provisions

Traffic-light a stress test for life insurance provisions MEMORANDUM Date 006-09-7 Authors Bengt von Bahr, Göran Ronge Traffc-lght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE-113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax

More information

THE APPLICATION OF DATA MINING TECHNIQUES AND MULTIPLE CLASSIFIERS TO MARKETING DECISION

THE APPLICATION OF DATA MINING TECHNIQUES AND MULTIPLE CLASSIFIERS TO MARKETING DECISION Internatonal Journal of Electronc Busness Management, Vol. 3, No. 4, pp. 30-30 (2005) 30 THE APPLICATION OF DATA MINING TECHNIQUES AND MULTIPLE CLASSIFIERS TO MARKETING DECISION Yu-Mn Chang *, Yu-Cheh

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Document Clustering Analysis Based on Hybrid PSO+K-means Algorithm

Document Clustering Analysis Based on Hybrid PSO+K-means Algorithm Document Clusterng Analyss Based on Hybrd PSO+K-means Algorthm Xaohu Cu, Thomas E. Potok Appled Software Engneerng Research Group, Computatonal Scences and Engneerng Dvson, Oak Rdge Natonal Laboratory,

More information

Searching for Interacting Features for Spam Filtering

Searching for Interacting Features for Spam Filtering Searchng for Interactng Features for Spam Flterng Chuanlang Chen 1, Yun-Chao Gong 2, Rongfang Be 1,, and X. Z. Gao 3 1 Department of Computer Scence, Bejng Normal Unversty, Bejng 100875, Chna 2 Software

More information

Using Association Rule Mining: Stock Market Events Prediction from Financial News

Using Association Rule Mining: Stock Market Events Prediction from Financial News Usng Assocaton Rule Mnng: Stock Market Events Predcton from Fnancal News Shubhang S. Umbarkar 1, Prof. S. S. Nandgaonkar 2 1 Savtrba Phule Pune Unversty, Vdya Pratshtan s College of Engneerng, Vdya Nagar,

More information

AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE

AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent

More information

Updating the E5810B firmware

Updating the E5810B firmware Updatng the E5810B frmware NOTE Do not update your E5810B frmware unless you have a specfc need to do so, such as defect repar or nstrument enhancements. If the frmware update fals, the E5810B wll revert

More information

Probabilistic Latent Semantic User Segmentation for Behavioral Targeted Advertising*

Probabilistic Latent Semantic User Segmentation for Behavioral Targeted Advertising* Probablstc Latent Semantc User Segmentaton for Behavoral Targeted Advertsng* Xaohu Wu 1,2, Jun Yan 2, Nng Lu 2, Shucheng Yan 3, Yng Chen 1, Zheng Chen 2 1 Department of Computer Scence Bejng Insttute of

More information

Improved SVM in Cloud Computing Information Mining

Improved SVM in Cloud Computing Information Mining Internatonal Journal of Grd Dstrbuton Computng Vol.8, No.1 (015), pp.33-40 http://dx.do.org/10.1457/jgdc.015.8.1.04 Improved n Cloud Computng Informaton Mnng Lvshuhong (ZhengDe polytechnc college JangSu

More information

Bayesian Network Based Causal Relationship Identification and Funding Success Prediction in P2P Lending

Bayesian Network Based Causal Relationship Identification and Funding Success Prediction in P2P Lending Proceedngs of 2012 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 25 (2012) (2012) IACSIT Press, Sngapore Bayesan Network Based Causal Relatonshp Identfcaton and Fundng Success

More information

Invoicing and Financial Forecasting of Time and Amount of Corresponding Cash Inflow

Invoicing and Financial Forecasting of Time and Amount of Corresponding Cash Inflow Dragan Smć Svetlana Smć Vasa Svrčevć Invocng and Fnancal Forecastng of Tme and Amount of Correspondng Cash Inflow Artcle Info:, Vol. 6 (2011), No. 3, pp. 014-021 Receved 13 Janyary 2011 Accepted 20 Aprl

More information

Mining Multiple Large Data Sources

Mining Multiple Large Data Sources The Internatonal Arab Journal of Informaton Technology, Vol. 7, No. 3, July 2 24 Mnng Multple Large Data Sources Anmesh Adhkar, Pralhad Ramachandrarao 2, Bhanu Prasad 3, and Jhml Adhkar 4 Department of

More information

Using Supervised Clustering Technique to Classify Received Messages in 137 Call Center of Tehran City Council

Using Supervised Clustering Technique to Classify Received Messages in 137 Call Center of Tehran City Council Usng Supervsed Clusterng Technque to Classfy Receved Messages n 137 Call Center of Tehran Cty Councl Mahdyeh Haghr 1*, Hamd Hassanpour 2 (1) Informaton Technology engneerng/e-commerce, Shraz Unversty (2)

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Calculating the high frequency transmission line parameters of power cables

Calculating the high frequency transmission line parameters of power cables < ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,

More information

Exploiting Recommendation on Social Media Networks

Exploiting Recommendation on Social Media Networks Internatonal Journal of Scence and Research IJSR) ISSN Onln: 2319-7064 Index Coperncus Value 2013): 6.14 Impact Factor 2013): 4.438 Explotng Recommendaton on Socal Meda Networs Swat A. Adhav 1, Sheetal

More information

Course outline. Financial Time Series Analysis. Overview. Data analysis. Predictive signal. Trading strategy

Course outline. Financial Time Series Analysis. Overview. Data analysis. Predictive signal. Trading strategy Fnancal Tme Seres Analyss Patrck McSharry [email protected] www.mcsharry.net Trnty Term 2014 Mathematcal Insttute Unversty of Oxford Course outlne 1. Data analyss, probablty, correlatons, vsualsaton

More information

How To Know The Components Of Mean Squared Error Of Herarchcal Estmator S

How To Know The Components Of Mean Squared Error Of Herarchcal Estmator S S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta

More information

PEER REVIEWER RECOMMENDATION IN ONLINE SOCIAL LEARNING CONTEXT: INTEGRATING INFORMATION OF LEARNERS AND SUBMISSIONS

PEER REVIEWER RECOMMENDATION IN ONLINE SOCIAL LEARNING CONTEXT: INTEGRATING INFORMATION OF LEARNERS AND SUBMISSIONS PEER REVIEWER RECOMMENDATION IN ONLINE SOCIAL LEARNING CONTEXT: INTEGRATING INFORMATION OF LEARNERS AND SUBMISSIONS Yunhong Xu, Faculty of Management and Economcs, Kunmng Unversty of Scence and Technology,

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

RequIn, a tool for fast web traffic inference

RequIn, a tool for fast web traffic inference RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France [email protected], [email protected] Abstract As networked

More information

Web Object Indexing Using Domain Knowledge *

Web Object Indexing Using Domain Knowledge * Web Object Indexng Usng Doman Knowledge * Muyuan Wang Department of Automaton Tsnghua Unversty Bejng 100084, Chna (86-10)51774518 Zhwe L, Le Lu, We-Yng Ma Mcrosoft Research Asa Sgma Center, Hadan Dstrct

More information

Mining Feature Importance: Applying Evolutionary Algorithms within a Web-based Educational System

Mining Feature Importance: Applying Evolutionary Algorithms within a Web-based Educational System Mnng Feature Importance: Applyng Evolutonary Algorthms wthn a Web-based Educatonal System Behrouz MINAEI-BIDGOLI 1, and Gerd KORTEMEYER 2, and Wllam F. PUNCH 1 1 Genetc Algorthms Research and Applcatons

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching) Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton

More information

Enterprise Master Patient Index

Enterprise Master Patient Index Enterprse Master Patent Index Healthcare data are captured n many dfferent settngs such as hosptals, clncs, labs, and physcan offces. Accordng to a report by the CDC, patents n the Unted States made an

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

Semantic Link Analysis for Finding Answer Experts *

Semantic Link Analysis for Finding Answer Experts * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 28, 51-65 (2012) Semantc Lnk Analyss for Fndng Answer Experts * YAO LU 1,2,3, XIAOJUN QUAN 2, JINGSHENG LEI 4, XINGLIANG NI 1,2,3, WENYIN LIU 2,3 AND YINLONG

More information

1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1.

1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1. HIGHER DOCTORATE DEGREES SUMMARY OF PRINCIPAL CHANGES General changes None Secton 3.2 Refer to text (Amendments to verson 03.0, UPR AS02 are shown n talcs.) 1 INTRODUCTION 1.1 The Unversty may award Hgher

More information

Canon NTSC Help Desk Documentation

Canon NTSC Help Desk Documentation Canon NTSC Help Desk Documentaton READ THIS BEFORE PROCEEDING Before revewng ths documentaton, Canon Busness Solutons, Inc. ( CBS ) hereby refers you, the customer or customer s representatve or agent

More information

Single and multiple stage classifiers implementing logistic discrimination

Single and multiple stage classifiers implementing logistic discrimination Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Assessing Student Learning Through Keyword Density Analysis of Online Class Messages

Assessing Student Learning Through Keyword Density Analysis of Online Class Messages Assessng Student Learnng Through Keyword Densty Analyss of Onlne Class Messages Xn Chen New Jersey Insttute of Technology [email protected] Brook Wu New Jersey Insttute of Technology [email protected] ABSTRACT Ths

More information

Performance Analysis and Coding Strategy of ECOC SVMs

Performance Analysis and Coding Strategy of ECOC SVMs Internatonal Journal of Grd and Dstrbuted Computng Vol.7, No. (04), pp.67-76 http://dx.do.org/0.457/jgdc.04.7..07 Performance Analyss and Codng Strategy of ECOC SVMs Zhgang Yan, and Yuanxuan Yang, School

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Fast Fuzzy Clustering of Web Page Collections

Fast Fuzzy Clustering of Web Page Collections Fast Fuzzy Clusterng of Web Page Collectons Chrstan Borgelt and Andreas Nürnberger Dept. of Knowledge Processng and Language Engneerng Otto-von-Guercke-Unversty of Magdeburg Unverstätsplatz, D-396 Magdeburg,

More information

Towards a Global Online Reputation

Towards a Global Online Reputation Hu L Unversty of Ottawa 55 Laurer Ave E Ottawa, ON KN 6N5 Canada + (63) 562 5800, 8834 [email protected] Towards a Global Onlne Reputaton Morad Benyoucef Unversty of Ottawa 55 Laurer Ave E Ottawa, ON KN

More information

How To Analyze News From A News Report

How To Analyze News From A News Report , pp. 385-396 http://dx.do.org/10.14257/jmue.2014.9.11.37 Topc Sentment Analyss n Chnese News Ouyang Chunpng, Zhou Wen +, Yu Yng, Lu Zhmng and Yang Xaohua School of Computer Scence and Technology, Unversty

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

320 The Internatonal Arab Journal of Informaton Technology, Vol. 5, No. 3, July 2008 Comparsons Between Data Clusterng Algorthms Osama Abu Abbas Computer Scence Department, Yarmouk Unversty, Jordan Abstract:

More information

Approaches to Text Mining for Clinical Medical Records

Approaches to Text Mining for Clinical Medical Records Approaches to Text Mnng for Clncal Medcal Records Xaohua Zhou and Hyol Han College of Informaton Scence and Technology Drexel Unversty Phladelpha, PA 19104 [email protected] [email protected] Isaac

More information

NEURO-FUZZY INFERENCE SYSTEM FOR E-COMMERCE WEBSITE EVALUATION

NEURO-FUZZY INFERENCE SYSTEM FOR E-COMMERCE WEBSITE EVALUATION NEURO-FUZZY INFERENE SYSTEM FOR E-OMMERE WEBSITE EVALUATION Huan Lu, School of Software, Harbn Unversty of Scence and Technology, Harbn, hna Faculty of Appled Mathematcs and omputer Scence, Belarusan State

More information

A heuristic task deployment approach for load balancing

A heuristic task deployment approach for load balancing Xu Gaochao, Dong Yunmeng, Fu Xaodog, Dng Yan, Lu Peng, Zhao Ja Abstract A heurstc task deployment approach for load balancng Gaochao Xu, Yunmeng Dong, Xaodong Fu, Yan Dng, Peng Lu, Ja Zhao * College of

More information

Design and Development of a Security Evaluation Platform Based on International Standards

Design and Development of a Security Evaluation Platform Based on International Standards Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 7-80 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School

More information

A Performance Analysis of View Maintenance Techniques for Data Warehouses

A Performance Analysis of View Maintenance Techniques for Data Warehouses A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao

More information

A Load-Balancing Algorithm for Cluster-based Multi-core Web Servers

A Load-Balancing Algorithm for Cluster-based Multi-core Web Servers Journal of Computatonal Informaton Systems 7: 13 (2011) 4740-4747 Avalable at http://www.jofcs.com A Load-Balancng Algorthm for Cluster-based Mult-core Web Servers Guohua YOU, Yng ZHAO College of Informaton

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

An Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement

An Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement An Enhanced Super-Resoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement Yu-Chuan Kuo ( ), Chen-Yu Chen ( ), and Chou-Shann Fuh ( ) Department of Computer Scence

More information

A Hierarchical Anomaly Network Intrusion Detection System using Neural Network Classification

A Hierarchical Anomaly Network Intrusion Detection System using Neural Network Classification IDC IDC A Herarchcal Anomaly Network Intruson Detecton System usng Neural Network Classfcaton ZHENG ZHANG, JUN LI, C. N. MANIKOPOULOS, JAY JORGENSON and JOSE UCLES ECE Department, New Jersey Inst. of Tech.,

More information

CHAPTER 14 MORE ABOUT REGRESSION

CHAPTER 14 MORE ABOUT REGRESSION CHAPTER 14 MORE ABOUT REGRESSION We learned n Chapter 5 that often a straght lne descrbes the pattern of a relatonshp between two quanttatve varables. For nstance, n Example 5.1 we explored the relatonshp

More information

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Single Layer Perceptrons Kevin Swingler Lecture 2: Sngle Layer Perceptrons Kevn Sngler [email protected] Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

More information

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan

More information

A Programming Model for the Cloud Platform

A Programming Model for the Cloud Platform Internatonal Journal of Advanced Scence and Technology A Programmng Model for the Cloud Platform Xaodong Lu School of Computer Engneerng and Scence Shangha Unversty, Shangha 200072, Chna [email protected]

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

How To Predct On The Web For Hfmd

How To Predct On The Web For Hfmd Proceedngs of the Twenty-Second Internatonal Jont Conference on Artfcal Intellgence Predctng Epdemc Tendency through Search Behavor Analyss Danqng Xu, Yqun Lu, Mn Zhang, Shaopng Ma, Anq Cu, Lyun Ru State

More information

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Brigid Mullany, Ph.D University of North Carolina, Charlotte Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

Gender Classification for Real-Time Audience Analysis System

Gender Classification for Real-Time Audience Analysis System Gender Classfcaton for Real-Tme Audence Analyss System Vladmr Khryashchev, Lev Shmaglt, Andrey Shemyakov, Anton Lebedev Yaroslavl State Unversty Yaroslavl, Russa [email protected], [email protected], [email protected],

More information

Multiple-Period Attribution: Residuals and Compounding

Multiple-Period Attribution: Residuals and Compounding Multple-Perod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens

More information

Predicting Software Development Project Outcomes *

Predicting Software Development Project Outcomes * Predctng Software Development Project Outcomes * Rosna Weber, Mchael Waller, June Verner, Wllam Evanco College of Informaton Scence & Technology, Drexel Unversty 3141 Chestnut Street Phladelpha, PA 19104

More information

A Simple Approach to Clustering in Excel

A Simple Approach to Clustering in Excel A Smple Approach to Clusterng n Excel Aravnd H Center for Computatonal Engneerng and Networng Amrta Vshwa Vdyapeetham, Combatore, Inda C Rajgopal Center for Computatonal Engneerng and Networng Amrta Vshwa

More information

http://wrap.warwick.ac.uk

http://wrap.warwick.ac.uk Orgnal ctaton: Crstea, Alexandra I. and De Moo, A. (2003) Desgner adaptaton n adaptve hypermeda authorng. In: Internatonal Conference on Informaton Technology : Codng and Computng (ITCC 2003), Las Vegas,

More information

Daily Mood Assessment based on Mobile Phone Sensing

Daily Mood Assessment based on Mobile Phone Sensing 2012 Nnth Internatonal Conference on Wearable and Implantable Body Sensor Networks Daly Mood Assessment based on Moble Phone Sensng Yuanchao Ma Bn Xu Yn Ba Guodong Sun Department of Computer Scence and

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

For example, you might want to capture security group membership changes. A quick web search may lead you to the 632 event.

For example, you might want to capture security group membership changes. A quick web search may lead you to the 632 event. Audtng Wndows & Actve Drectory Changes va Wndows Event Logs Ths document takes a lghtweght look at the steps and consderatons nvolved n settng up Wndows and/or Actve Drectory event log audtng. Settng up

More information

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1 Send Orders for Reprnts to [email protected] The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information