Personalized Information Retrieval Approach

Size: px
Start display at page:

Download "Personalized Information Retrieval Approach"

Transcription

1 Personalzed Informaton Retreval Approach Myram Hadjoun 1, Mohamed Ramz Haddad 1, Hajer Baazaou 1, Mare-Aude Aufaure 2, and Henda Ben Ghezala 1 1 Laboratory RIADI-GDL, Natonal School of Computer Scences, Unversty of Manouba, 2010 la Manouba, Tunsa {myram.hadjoun, hajer.baazaouzghal, henda.benghezala}@rad.rnu.tn haddad.medramz@gmal.com 2 MAS Laboratory, SAP BusnessObjects Char, Ecole Centrale Pars, Grande Voe des Vgnes, Chatenay-Malabry, France mare-aude.aufaure@ecp.fr Abstract. Web nformaton system personalzaton s an emergent research feld wth the objectve to facltate the use and the control of Web content. Ths paper presents a personalzed nformaton retreval approach based on end user modellng. The proposed approach personalzes data retreval usng mplct user nformaton and nterests measurements. As the data manpulated s expressed by attrbutes and values, we defne several smlarty measures. These measurements consder both semantc and spatal user contexts. The approach personalzes Web content and especally spatal nformaton focusng on ts spatal semantc aspects. Keywords: Web personalzaton, spatal Web personalzaton, user modelng 1 Introducton The volume of nformaton avalable on Web nformaton systems s growng contnuously. Browsng ths content becomes a tedous task gven the presentaton of data that does not meet user s ams and needs. To satsfy user needs, personalzaton s an approprate soluton to provde an adaptve and ntellgent Human-Computer- Interacton (H.C.I) and to mprove the nformaton systems usablty. Moreover, Web resources ncreasngly contan geo-referenced enttes generally assocated wth a geographcal locaton [1]. Geographc nformaton systems suffer from a lack of data qualty snce the presented data s hghly complex and dverse. Manpulated objects have a very rch semantc and the degrees of user s nterests towards them vary dependng on context and on personal tastes. Exstng personalzaton approaches try to determne user preferences to help hm whle explorng nformaton. However, these approaches have some drawbacks and generally neglect semantc and spatal aspect of the manpulated data. The semantc Web provdes an approprate

2 Proceedngs of WISM 2009 background to defne and to descrbe nformaton systems content n order to take nto account ts dfferent semantcs and to effcently understand t. Ths paper presents a personalzed nformaton retreval approach based on end user modelng. The proposed approach personalzes data retreval usng mplct user nformaton and nterests measurements. We start, n the next secton wth related works presentaton and dscusson. We then present our archtecture ncludng user and data modelng approaches and the smlarty measures used to ncrease the qualty of the personalzaton process and the measures used to deduce user s nterest. These measures help us to construct a user s network based on our proposed system. Secton 4 presents ths network. Secton 5 concludes our work and gves some perspectves. 2 Related Works Generally, personalzaton methodologes are dvded nto two complementary processes whch are (1) the user nformaton collecton, used to descrbe the user nterests and (2) the nference of the gathered data to predct the closest content to the user expectaton. In the frst case, user profles can be used to enrch queres and to sort results at the user nterface level [2]. Or, n other technques, they are used to nfer relatonshps lke the socal-based flterng [3] and the collaboratve flterng [4]. For the second process, extracton of nformaton on users navgatons from system log fles can be used [5]. Some nformaton retreval technques are based on user contextual nformaton extracton [6]. Informaton semantcs are also used to enrch the personalzaton process; queres can be enrched by addng new propertes from the avalable doman ontologes [7]. The user modelng based on ontology can be coupled wth dynamc update of user profle usng results of nformaton-flterng and Web usage mnng technques. Wth the evoluton of the nternet, Web resources ncreasngly contan georeferenced enttes generally assocated wth a geographcal locaton [1]. Statstcs collected through search engnes show that spatal nformaton s pervasve on the Web and that many queres contan spatal specfcatons, but t s more dffcult to fnd relevant resources respondng to query ncludng a spatal component [8]. The spatal nformaton personalzaton should consder spatal propertes and relatonshps found n Web documents. Desgn of spatal Web applcatons requres at least three components: (1) a user model and assocated user preference elctaton mechansms and (2) a personalzaton engne combnng spatal and semantc crtera and (3) a user nterface enrched wth spatal components [9]. The spatal Web personalzaton requres the representaton of user features, partcularly those relevant to the spatal doman. [10] explores semantc smlarty and spatal proxmty measures as well as relevance rankng functons on the behalf of the user. Semantc smlarty s the evaluaton of semantc lnks exstng between two concepts [11]. [12] ntroduced a classfcaton algorthm for measurng spatal proxmty between two regons. Another aspect of spatal Web personalzaton technques concerns nteractve adaptve map generaton and vsualzaton. These technques are concerned wth Web maps adaptaton accordng to user s needs [13]. In a prototype

3 Proceedngs of WISM 2009 appled to martme navgaton, [14] categorzes the users accordng to ther geographcal context. The presented personalzaton approaches have contrbuted to the mprovement of nformaton systems use. However and despte ther wdespread use, these approaches have weaknesses and lmtatons. In fact, several approaches, lke the collaboratve ones, present the same recommendatons for all users wthn the same cluster. Thus, they do not consder some specfc users preferences when they represent a mnorty n a gven group. Content based approaches facltate tems retreval by proposng some alternatves and recommendng smlar tems to the one that the user s vstng. However t focuses only on the user s actual and temporary needs and can t hghlght the tems that are related to the current query results. Other approaches try to determnate the nterests of each user but they are lmted by ther tems model that doesn t descrbe the dfferences between tems propertes. Ths lack of semantc descrpton of the tems decreases the qualty of personalzaton snce smlartes and dssmlartes between tems can t be measured accurately. In addton, n most personalzaton approaches, the spatal aspect s not taken nto consderaton, whch requres an adaptaton of those approaches to be relevant whle appled to spatal nformaton. These lmtatons explan the mportance gven to hybrd approaches. The hybrdzaton of exstng approaches s presented as an alternatve that would mprove the qualty of personalzed systems [15]. 3 Personalzed Informaton Retreval System We present n ths secton a Personalzed Informaton Retreval approach for Web nformaton systems. Our proposton s based on a dynamc and teratve constructon of a multdmensonal user model. Ths multdmensonal approach s used to represent and descrbe the user towards dfferent dmensons. The model proposed (noted M u ) s composed of 4 dmensons: user profle, spatal model, graphc model and textual model. If we consder U as the set of users, a user u U wll have as model M u : M u = (1) D D D P t s n Where: D t = keywords employed by the users for ther textual search D s = spatal postons of the users D n = enttes vsted by the users P = user profle. Ths model s part of the user modelng level of our system whch s composed of the followng ones: user level, applcaton level, user modelng level, nformaton retreval level and storage level [16]. In ths paper, we only consder the modelng level whch s also concerned wth the exploraton and the dentfcaton of semantc and spatal relatonshps between enttes extracted from log fles or from real-tme navgaton.

4 Proceedngs of WISM 2009 Users can be known or unknown. A known user has an account and s ndvdually dentfed by the system whle an unknown user does not possess proper profle. So, the user modellng level s also dealng wth: For unknown users: (1) the constructon of user real-tme profle and (2) the mappng of ths current user nto the closest prototype. For known users: (1) the actvaton of the concerned user model and (2) the update of hs real-tme profle. The model s based on an mplct nteracton wth the user: mplct because the user sn t drectly asked to gve opnon, and nteractve because we use the navgaton to measure ts nterest to a gven entty. These measurements are based on: The smlartes that could exst between attrbutes and enttes of nterest. The deducton of user nterests from all ts navgaton. The calculaton of the pertnence of a supposed spatal move. In fact, n our approach, we also consder that f a user n nterested on a spatal zone, he ams to move to. Next sectons present the measurements cted above Smlarty measures The smlarty measures used n our system are attrbutes values smlarty and entty smlarty. Attrbutes values smlarty These attrbutes can be smple attrbutes lke numerc values, Booleans and strngs. Otherwse, attrbutes can be composte such as numerc ntervals and sets, or strngs sets. We defne for each attrbute type a smlarty measure: Numerc values: These values are dscrete, so t s necessary to have a smlarty functon to dvde ther varaton ntervals nto sets of smlar values such as for hotel prces or rooms number. Each value can be consdered to be smlar to neghbourhood s values. The neghbourhood s wdth ncreases when the value s hgh and vce versa. We defne neghbourhood of smlar values as: α α Sm ( α ) = β, β α, α + (2) ε ε Where ε defnes the neghbourhood s wdth. Semantc dstance between α and β [a,b] s: D sem α β α, β ) = a b ( (3) And the smlarty degree between them s: D ( α, β ) = 1 D ( α, β ) sm sem (4) Wth these three equatons, we wll have the smlarty as: Sm ( 2α ) b a ( α ) = β, D ( α, β ) 1 ε (5) sm

5 Proceedngs of WISM 2009 Numerc ntervals: The nterval attrbutes may have common values. These values are ncluded wthn the smlarty measure. If we consder A and B as two numerc ntervals, the smlarty degree between them s: D sm A B ( A, B ) = (6) A B Sets: as for ntervals, groups or lsts can have common values. Here, we need to defne the well known ntersecton and unon operators to nclude our smlarty. Let s consder Sm(F,a ) the set of all values that are smlar to the value a of the attrbute F. Intersecton and unon operators takng nto account the smlarty appled to the sets A consdered as reference, and B are: Defnton 1 A B =, s s { a A, b j B tq b j Sm ( F a )} A { b B, a A tq b Sm( F a )} A B =, j So, wth A and B as two sets of numerc values, the degree of smlarty becomes: D sm card A, B) = card { A B} s { A s j ( (7) Thus, A and B are consdered smlar f D ( A, B) ε. sm ε s the smlarty threshold to be determned n relaton to the attrbute semantc. Other types: On the cases of the other types of attrbutes lke strngs or Boolean the smlarty operator s equalty. Enttes smlarty The smlarty measure between two enttes corresponds to the aggregaton of ther attrbutes smlarty degrees. If x and y are two enttes of the same concept, γf s the attrbute s mportance coeffcent. α and β are the attrbute values submtted by x and y. Semantc dstance between them s: D sem ( α, ) n ( x, y ) = F * D β sem = 1 γ (8) Wth n: number of attrbutes descrbng x and y whch depends on the concept to whch they belong. Havng ε as the smlarty entry of the attrbute F, we consder that x and y are smlar f: n D ( x, y) γ F * ε sem = 1 So the set of smlar enttes to x s: n Sm() x = D ( x, y) 1 F * ε sm = 1 (9) γ (10) For buldng the user model, we start wth the profle constructon, takng nterests nto consderaton. Ths nformaton s deduced by measurng user nterests related to

6 Proceedngs of WISM 2009 textual, spatal and navgatonal dmensons. Next secton presents the approach used to buld the user profle usng nformaton from navgatonal dmenson User nterests The concept of mplct nformaton gatherng adopted s as follow: when a user touches nformaton, he s mplctly votng for t. Based on ths assumpton, we ntroduce measures that am to deduce user nterests. In the followng, u represents a user; an tem vsted by u s noted as x and a concept (accommodaton, restaurant, etc ) to whch x belongs s noted C. Interests ndcators The user profle, n our context, s also used to descrbe user nterest towards the vsted tems. We use the followng parameters: Vsts frequency: Represents the number of vsts to a gven tem. Ths number can reflect the user nterest for an tem or a group of tems and can be used to determne the most nterestng ones. Vsts duraton: In addton to the vsts rate, the vst duraton s also sgnfcant as users spend more tme readng nformaton perceved as relevant [1]. Explct tems ratng: User s behavours do not always reflect hs real nterest: a user can vst an tem descrpton more than once or spend much tme on readng t just to satsfy curosty. To avod such stuaton, the user can explctly evaluate hs nterest. Ths evaluaton s then used to adjust the prevous measures notes. Vsted enttes nterest The man measures used here to deduce the user nterest are the frequency and the duraton of vsts. To do ths, we use all saved user transactons and ther duraton. If the user gves an explct evaluaton on a vsted entty, we can refne these measures. The nterest degree I e of a u towards a vsted tem x, consderng only the semantc aspect of x, s: 1 d ( u, x) n ( u, x) I ( u, x) = v + v V ( U, x) e 2 D () u N () u (11) v v Where d v (u,x) : Duraton of the user vsts to x. D v (u) : Total duraton of the user vsts. n v (u,x) : Number of tmes the user u vsted x. N v (u) : Total number of user vsts u. V(u,x) : Average rate assgned by u to x. Ths note s between 0 (not nterestng) and 1 (Very nterestng). The default value s 0.5 f the user dd not rate the tem. Thus, the qualty of preferences and nterests elctaton process ncreases when the user evaluates explctly vsted enttes. Takng nto account ratngs s mportant when a user spends a long tme vstng an entty that s not nterestng for hm or when he vsts frequently an tem that he s not plannng to vst. So, ratng ths entty would reduce the nfluence of the duraton and the frequency of those vsts.

7 Proceedngs of WISM 2009 Concepts nterest Spatal enttes are classfed nto several predefned concepts wth regard to the consdered doman. Each spatal concept s defned by several attrbutes whch are used to descrbe enttes belongng to t. In order to make a personalzed and relevant classfcaton of concepts we measure the user nterest towards spatal/semantc enttes belongng to a consdered concept. Wth x C, the nterest degree of u towards C s: I c ( u, x ) Where n s the number of tems x vsted by u. I e (u,x ) : The nterest degree of u towards x. n ( u, c ) = I e (12) = 1 Features values nterest After presentng the metrc for classfyng concepts by nterests degrees, we am to order enttes wthn the same concept accordng to ther relevance. Ths s done wth correlaton to concepts,.e. the attrbute s nterest degree value s calculated by consderng the nterest to enttes wth smlar value. Consder an attrbute F C and v k one possble value of F and X(F,Sm(F,v k )) the set of all enttes vsted by the user and whch have a smlar value to v k. Sm(F,v k ) s the set of F values that are smlar to v k. The smlarty operators depend on the attrbute type and semantc. The nterest value of u the value v k s: I f ( u, F, v ) = k x j ( F, Sm( F, v ) k I e u, x j The next step s to normalze ths nterest value to be ndependent of the elements number. I v I ( U, F, v ) f k U, F, v ) = k v V ( F ) I ( U, F, v ) j f (13) ( (14) Where V(F ) s the set of all possble attrbute F values. Interest predcton As already mentoned, user preferences are ntroduced by nterests degrees on spatal/semantc concepts and ther attrbutes values are deduced from user navgatons. We use the prevous metrcs to predct the user s nterest degree for the non-vsted tems. So, we assume that: The user s nterest degree towards a concept ncreases wth the number of vsts to enttes of ths concept. The more preferred entty values are, the more ths entty s lkely to be vsted. The concepts attrbutes have dfferent mportance degrees. So we can dstngush between the crtcal attrbutes and those that do not nfluence the user choces. Ths measure s used to predct the most relevant content the user s searchng for. Moreover, t contrbutes to refne results of textual search manly based on the use of concepts and attrbutes that wll defne the doman ontology. We am to deduce ths ontology from prevous (and current) search and navgatons and not to explctly nvolve the user. To acheve these ponts, we present the followng formula, whch

8 Proceedngs of WISM 2009 predcts the degree of user satsfacton for one entty x dependng on ts concept C and ts attrbutes values: S n ( x, u) = I ( u, C) α I ( u, F, v) (15) c = 1 Where n s the number of the concept attrbutes C v s the value of the attrbutes F presented by the entty x. Ic(u,C) s the nterest degree of u on the concept C. I v (U,F,v) s the nterest degree of u on the value v of F. F v 4 Constructon of the user results Havng as objectve the ameloraton of users results, we terate the constructon of hs model. In the end of each teraton, we determne the data pertnence and use ths value n the next teraton. Wth ths hypothess, two types of nformaton are the bass of personalzaton: the locaton of user at the moment of hs search and noted L u and the locaton of hs area of nterest correspondng to the target search zone noted Z. The area of nterest s deduced from the poston on a map n the user nterface or from the search keywords. The results provded to users are constructed on the bass of three ponts: (a) the path needed to reach the area of nterest Z from the user locaton when searchng L u, (b) the arrval pont and (c) the semantc and spatal dstance between a departure pont and the objects of nterest. The area of nterest path. The estmaton of the arrval path over the area of nterest s a qualty crteron. In fact, the taken path has an mpact on the arrval pont nto the area of nterest and therefore affects the locaton of objects of nterest dsplayed to the user. In ths context, we use a qualtatve evaluaton based on an explct weghtng of crtera such as cost or type of way. Then, the user can add ts own choce value. The mnmum crtera that we have taken are the type of road, ts cost and dstance travelled. The weghts are made of values between 0 and 1, values whch are gven n the form of notes by the user. The path evaluaton equaton s: Wth α, β and λ ]0,1] EvalPath = α. Type * β. Cost * λds tan ce (16) The arrval estmaton. The move of the user from ts search locaton to ts area of nterest can provde us two types of nformaton: (1) the arrval pont nformaton deduced from the path taken when move and (2) a locaton marker that s the collapse pont of the user, we called t departure pont. Ths pont may be the subway staton closest to the object of nterest or the user resdence. The dstance between the arrval and the departure ponts s equal to 1 when these two ponts are joned. The hypotheses are: Exstence of an arrval pont n Z.

9 Proceedngs of WISM 2009 If user moves to Z, he has a departure pont and a path: d(arrval pont, departure pont) The evaluaton s based on the path and on the semantc of the searched object: ( ArrPt, Path ) = D ( ArrPt, DepPt ) Sem( SearchObje ct) (17) Eval * SemSpa Semantc and spatal dstances. These dstances are the key features to nclude the spatal aspect nto the nformaton flterng process. Semantc and spatal dstances between the departure pont DepPt and the nterest objects object are evaluated as shown below: DsemSpa n ( ArrPt, DepPt) = Dspa(object,DepPt) * Dsem(object,DepPt) (18) = 1 Where: n s the number of the nterestng objects n the area Z. Dspa(object,DepPt) s the spatal dstance between object and DepPt. Dsem(object,DepPt) s the semantc dstance between object and DepPt. In the end of every teraton, these three measures are appled to amelorate the next one. Takng nto account the area of nterest path wll explctly mplcate the user, whle the arrval estmaton and the semantc and spatal dstances calculaton s mplctly done. 5 Concluson and Future Work Web personalzaton attracts rsng research efforts to facltate Web nformaton retreval and navgaton. Generally, Web personalzaton and user modelng approaches do not focus on the spatal aspect of the nformaton and the constrants t mples. In ths paper, we have presented some background knowledge on exstng Web and spatal Web personalzaton systems. We have then ntroduced our proposton for a personalzed nformaton retreval approach whch s manly based on the end user modelng. The user model s multdmensonal and t s bult wth teratons that use estmatons calculated from mplct user s navgaton nformaton. Next step of our work s to add to ths personalzaton process (1) nteractons between the users models and (2) as a consequence, the constructon of a network of models. In fact, as we consder smlartes and dstance between the search concepts and enttes wthn ths process, we assume that addng also smlartes measurements between the users models could be helpful n the personalzaton process.

10 Proceedngs of WISM 2009 References 1. Wnter, S., Tomko, M.: Translatng the Web Semantcs of Georeferences. In Tanar, D.; Rahayu, W. (Eds.), Web Semantcs and Ontology, pp , Idea Publshng (2006) 2. Koutrka, G., Ioannds, Y.: A Unfed User-profle Framework for Query Dsambguaton and Personalzaton. In: Workshop on New Technologes for Personalzed Informaton Access, held n conjuncton wth the 10 th Internatonal Conference on User Modelng, pp (2005) 3. Mladenc D.: Text-learnng and Related Intellgent Agents: a Survey. IEEE Intellgent Systems, 14(4):44 54 (1999) 4. Goldberg, K., Roeder, T., Gupta, D., Perkns, C.: Egentaste, a Constant Tme Collaboratve Flterng Algorthm. Informaton Retreval Journal, 4(2): , (2001) 5. Paulaks, S., Lampos, C., Ernak, M., Vazrganns, M.: Sewep: A Web Mnng System Supportng Semantc Personalzaton. In: 15 th European Conference on Machne Learnng and 8 th European Conference on Prncples and Practce of Knowledge Dscovery n Databases, LNCS, vol. 3202, pp , Sprnger (2004) 6. Jones, G.J.F., Brown, P.J.: Context-Aware Retreval for Ubqutous Computng Envronments. Invted paper n Moble and Ubqutous Informaton Access, LNCS, vol. 2954, pp Sprnger (2004) 7. Messa, N., Devgnes, M.D., Napol, A., Smaïl-Tabbone, M.: Méthode Sémantque pour la Classfcaton et l Interrogaton des Sources de Données Génomques. Revue des Nouvelles Technologes de l Informaton, Extracton des connassances : Etat et Perspectves, pp (2005) 8. Yang, Y., Aufaure, M.A., Claramunt, C.: Towards a DL-Based Semantc User Model for Web Personalzaton. In: Thrd Internatonal Conference on Autonomc and Autonomous Systems, pp IEEE Computer Socety (2007) 9. Kuhn, W.: Handlng Data Spatally: Spatalzng User Interfaces. In: 7 th Internatonal Symposum on Spatal Data Handlng, Advances n GIS Research II, vol. 2, pp.13b.1-13b.23, IGU (1996) 10. Yang, Y.: Towards Spatal Web Personalzaton. PhD thess, Ecole Natonale Supéreure d Arts et Méters (2006) 11. Resnk, P.: Semantc Smlarty n a Taxonomy: an Informaton-Based Measure and ts Applcaton to Problems of Ambguty n Natural Language. Journal of Artfcal Intellgence Research, 11: (1999) 12. Larson, R.R., Frontera, P.: Spatal Rankng Methods for Geographc Informaton Retreval n Dgtal Lbrares. In: Heery, R., Lyon, L., (eds.) ECDL. LNCS, vol. 3232, pp Sprnger (2004) 13. Maceachren, A.M., Kraak, M.J.: Research Challenges n Geovsualzaton. Cartography and Geographc. Informaton Scence, 28(1):3 12 (2001) 14. Pett, M., Ray, C., Claramunt, C.: A User Context Approach for Adaptve and Dstrbuted GIS. In: 10th Internatonal Conference on Geographc Informaton Scence. Sprnger- Verlag, LNGC, pp (2007) 15. Burke, R.: Hybrd Recommender Systems: Survey and Experments. User Modelng and User-Adapted Interacton, 12(4): (2002) 16. Hadjoun, M., Baazaou, H., Aufaure, M.A., Claramunt, C., Ben Ghezala, H.: Towards a Personalzed Spatal Web Archtecture. In: Workshop Semantc Web meets Geopatal Applcatons, held n conjuncton wth the AGILE Internatonal Conference on Geographc Informaton Scence (2008) 17. Kelly, D., Belkn, N.J.: Readng Tme, Scrollng and Interacton: Explorng Implct Sources of User Preferences for Relevant Feedback. In: 24th Annual Internatonal ACM SIGIR Conference on Research and Development n Informaton Retreval, pp , ACM (2001)

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

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

More information

Query Clustering Using a Hybrid Query Similarity Measure

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

More information

Rules for Using Multi-Attribute Utility Theory for Estimating a User s Interests

Rules for Using Multi-Attribute Utility Theory for Estimating a User s Interests Rules for Usng Mult-Attrbute Utlty Theory for Estmatng a User s Interests Ralph Schäfer 1 DFKI GmbH, Stuhlsatzenhausweg 3, 66123 Saarbrücken Ralph.Schaefer@dfk.de Abstract. In ths paper, we show that Mult-Attrbute

More information

Cluster Analysis of Electrical Behavior

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

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

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

More information

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

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

More information

A Binarization Algorithm specialized on Document Images and Photos

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

More information

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

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

More information

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

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

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

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

More information

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

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

More information

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

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

More information

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

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

More information

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

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

More information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

Machine Learning: Algorithms and Applications

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

More information

Performance Evaluation of Information Retrieval Systems

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

More information

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

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

More information

UB at GeoCLEF Department of Geography Abstract

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

More information

Relevance Feedback for Image Retrieval

Relevance Feedback for Image Retrieval Vashal D Dhale et al, / (IJCSIT Internatonal Journal of Computer Scence and Informaton Technologes, Vol 4 (2, 203, 39-323 Relevance Feedback for Image Retreval Vashal D Dhale, Dr A R Mahaan, Prof Uma Thakur

More information

Enhancement of Infrequent Purchased Product Recommendation Using Data Mining Techniques

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

More information

CORE: A Tool for Collaborative Ontology Reuse and Evaluation

CORE: A Tool for Collaborative Ontology Reuse and Evaluation CRE: A Tool for Collaboratve ntology Reuse and Evaluaton Mram Fernández, Iván Cantador, Pablo Castells Escuela Poltécnca Superor Unversdad Autónoma de Madrd Campus de Cantoblanco, 28049 Madrd, Span {mram.fernandez,

More information

Classifier Selection Based on Data Complexity Measures *

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

More information

Alignment Results of SOBOM for OAEI 2010

Alignment Results of SOBOM for OAEI 2010 Algnment Results of SOBOM for OAEI 2010 Pegang Xu, Yadong Wang, Lang Cheng, Tany Zang School of Computer Scence and Technology Harbn Insttute of Technology, Harbn, Chna pegang.xu@gmal.com, ydwang@ht.edu.cn,

More information

A Ubiquitous Approach for Next Generation Information Systems

A Ubiquitous Approach for Next Generation Information Systems A Ubqutous Approach for Next Generaton Informaton Systems Tarek H. El-Basuny Department of Informaton and Computer Scence, Kng Fahd Unversty of Petroleum and Mnerals, KFUPM # 37, Dhahran 31261, Saud Araba,

More information

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

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

More information

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

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

More information

Recommender System based on Higherorder Logic Data Representation

Recommender System based on Higherorder Logic Data Representation Recommender System based on Hgherorder Logc Data Representaton Lnna L Bngru Yang Zhuo Chen School of Informaton Engneerng, Unversty Of Scence and Technology Bejng Abstract Collaboratve Flterng help users

More information

The Codesign Challenge

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

More information

Ontology Generator from Relational Database Based on Jena

Ontology Generator from Relational Database Based on Jena Computer and Informaton Scence Vol. 3, No. 2; May 2010 Ontology Generator from Relatonal Database Based on Jena Shufeng Zhou (Correspondng author) College of Mathematcs Scence, Laocheng Unversty No.34

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Revealing Paths of Relevant Information in Web Graphs

Revealing Paths of Relevant Information in Web Graphs Revealng Paths of Relevant Informaton n Web Graphs Georgos Kouzas 1, Vassleos Kolas 2, Ioanns Anagnostopoulos 1 and Eleftheros Kayafas 2 1 Unversty of the Aegean Department of Fnancal and Management Engneerng

More information

A Resources Virtualization Approach Supporting Uniform Access to Heterogeneous Grid Resources 1

A Resources Virtualization Approach Supporting Uniform Access to Heterogeneous Grid Resources 1 A Resources Vrtualzaton Approach Supportng Unform Access to Heterogeneous Grd Resources 1 Cunhao Fang 1, Yaoxue Zhang 2, Song Cao 3 1 Tsnghua Natonal Labatory of Inforamaton Scence and Technology 2 Department

More information

Keyword-based Document Clustering

Keyword-based Document Clustering Keyword-based ocument lusterng Seung-Shk Kang School of omputer Scence Kookmn Unversty & AIrc hungnung-dong Songbuk-gu Seoul 36-72 Korea sskang@kookmn.ac.kr Abstract ocument clusterng s an aggregaton of

More information

Signature and Lexicon Pruning Techniques

Signature and Lexicon Pruning Techniques Sgnature and Lexcon Prunng Technques Srnvas Palla, Hansheng Le, Venu Govndaraju Centre for Unfed Bometrcs and Sensors Unversty at Buffalo {spalla2, hle, govnd}@cedar.buffalo.edu Abstract Handwrtten word

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

An Optimal Algorithm for Prufer Codes *

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

More information

SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE

SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro

More information

Oracle Database: SQL and PL/SQL Fundamentals Certification Course

Oracle Database: SQL and PL/SQL Fundamentals Certification Course Oracle Database: SQL and PL/SQL Fundamentals Certfcaton Course 1 Duraton: 5 Days (30 hours) What you wll learn: Ths Oracle Database: SQL and PL/SQL Fundamentals tranng delvers the fundamentals of SQL and

More information

Available online at Available online at Advanced in Control Engineering and Information Science

Available online at   Available online at   Advanced in Control Engineering and Information Science Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced

More information

Optimizing Document Scoring for Query Retrieval

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

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

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

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

More information

TN348: Openlab Module - Colocalization

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

More information

Adaptive Knowledge-Based Visualization for Accessing Educational Examples

Adaptive Knowledge-Based Visualization for Accessing Educational Examples Adaptve Knowledge-Based Vsualzaton for Accessng Educatonal Examples Peter Bruslovsky, Jae-wook Ahn, Tbor Dumtru, Mchael Yudelson School of Informaton Scences, Unversty of Pttsburgh {peterb, jaa38, mvy3}@ptt.edu

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Smoothing Spline ANOVA for variable screening

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

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

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

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

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Related-Mode Attacks on CTR Encryption Mode

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

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Querying by sketch geographical databases. Yu Han 1, a *

Querying by sketch geographical databases. Yu Han 1, a * 4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,

More information

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,

More information

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

Your Neighbors Affect Your Ratings: On Geographical Neighborhood Influence to Rating Prediction Your Neghbors Affect Your Ratngs: On Geographcal Neghborhood Influence to Ratng Predcton Longke Hu lhu003@e.ntu.edu.sg Axn Sun axsun@ntu.edu.sg Yong Lu luy0054@e.ntu.edu.sg School of Computer Engneerng,

More information

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

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

More information

IN recent years, recommender systems, which help users discover

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

More information

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

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

More information

A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION

A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION 1 FENG YONG, DANG XIAO-WAN, 3 XU HONG-YAN School of Informaton, Laonng Unversty, Shenyang Laonng E-mal: 1 fyxuhy@163.com, dangxaowan@163.com, 3 xuhongyan_lndx@163.com

More information

Wishing you all a Total Quality New Year!

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

More information

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

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

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Support Vector Machines

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

More information

An Image Fusion Approach Based on Segmentation Region

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

More information

Behavioral Model Extraction of Search Engines Used in an Intelligent Meta Search Engine

Behavioral Model Extraction of Search Engines Used in an Intelligent Meta Search Engine Behavoral Model Extracton of Search Engnes Used n an Intellgent Meta Search Engne AVEH AVOUSI Computer Department, Azad Unversty, Garmsar Branch BEHZAD MOSHIRI Electrcal and Computer department, Faculty

More information

X- Chart Using ANOM Approach

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

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

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

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

S1 Note. Basis functions.

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

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

Exploration of applying fuzzy logic for official statistics

Exploration of applying fuzzy logic for official statistics Exploraton of applyng fuzzy logc for offcal statstcs Mroslav Hudec Insttute of Informatcs and Statstcs (INFOSTAT), Slovaka, hudec@nfostat.sk Abstract People are famlar wth lngustc terms e.g. hgh response

More information

3D vector computer graphics

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

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

Classification / Regression Support Vector Machines

Classification / Regression Support Vector Machines Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM

More information

An Approach for Recommender System by Combining Collaborative Filtering with User Demographics and Items Genres

An Approach for Recommender System by Combining Collaborative Filtering with User Demographics and Items Genres Volume 18 No.13, October 015 An Approach for Recommender System by Combnng Collaboratve Flterng wth User Demographcs and Items Genres Saurabh Kumar Twar Department of Informaton Technology Samrat Ashok

More information

Information Filtering Using the Dynamics of the User Profile

Information Filtering Using the Dynamics of the User Profile Informaton Usng the Dynamcs of the User Profle Costn Barbu, Marn Smna Electrcal Engneerng and Computer Scence Department Tulane Unversty New Orleans, LA, 70130 {barbu, smna}@eecs.tulane.edu Abstract Ths

More information

Impact of Contextual Information for Hypertext Documents Retrieval

Impact of Contextual Information for Hypertext Documents Retrieval Impact of Contextual Informaton for Hypertext ocuments Retreval Idr Chbane and Bch-Lên oan SUPELEC Computer Scence dpt. Plateau de Moulon 3 rue Jolot Cure 9 92 Gf/Yvette France {Idr.Chbane Bch-Len.oan}@supelec.fr

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

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

More information

Semantic Image Retrieval Using Region Based Inverted File

Semantic Image Retrieval Using Region Based Inverted File Semantc Image Retreval Usng Regon Based Inverted Fle Dengsheng Zhang, Md Monrul Islam, Guoun Lu and Jn Hou 2 Gppsland School of Informaton Technology, Monash Unversty Churchll, VIC 3842, Australa E-mal:

More information

Web Document Classification Based on Fuzzy Association

Web Document Classification Based on Fuzzy Association Web Document Classfcaton Based on Fuzzy Assocaton Choochart Haruechayasa, Me-Lng Shyu Department of Electrcal and Computer Engneerng Unversty of Mam Coral Gables, FL 33124, USA charuech@mam.edu, shyu@mam.edu

More information

Recommendations of Personal Web Pages Based on User Navigational Patterns

Recommendations of Personal Web Pages Based on User Navigational Patterns nternatonal Journal of Machne Learnng and Computng, Vol. 4, No. 4, August 2014 Recommendatons of Personal Web Pages Based on User Navgatonal Patterns Yn-Fu Huang and Ja-ang Jhang Abstract n ths paper,

More information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION 1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

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

More information

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

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

More information

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

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

More information

Interfaces for networked media exploration and collaborative annotation

Interfaces for networked media exploration and collaborative annotation Interfaces for networked meda exploraton and collaboratve annotaton Preetha Appan Bageshree Shevade Har Sundaram Davd Brchfeld Arts Meda and Engneerng Program, AME-TR-2004-11 Arzona State Unversty Tempe,

More information

THE MAP MATCHING ALGORITHM OF GPS DATA WITH RELATIVELY LONG POLLING TIME INTERVALS

THE MAP MATCHING ALGORITHM OF GPS DATA WITH RELATIVELY LONG POLLING TIME INTERVALS THE MA MATCHING ALGORITHM OF GS DATA WITH RELATIVELY LONG OLLING TIME INTERVALS Jae-seok YANG Graduate Student Graduate School of Engneerng Seoul Natonal Unversty San56-, Shllm-dong, Gwanak-gu, Seoul,

More information

The Effect of Similarity Measures on The Quality of Query Clusters

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

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

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

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

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

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

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

More information

Cell Count Method on a Network with SANET

Cell Count Method on a Network with SANET CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan

More information