CORE: A Tool for Collaborative Ontology Reuse and Evaluation

Size: px
Start display at page:

Download "CORE: A Tool for Collaborative Ontology Reuse and Evaluation"

Transcription

1 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, Madrd, Span {mram.fernandez, van.cantador, pablo.castells}@uam.es ABSTRACT ntology evaluaton can be defned as assessng the qualty and the adequacy of an ontology for beng used n a specfc context, for a specfc goal. In ths work, a tool for Collaboratve ntology Reuse and Evaluaton (CRE) s presented. The system receves an nformal descrpton of a semantc doman and deteres whch ontologes, from an ontology repostory, are the most approprate to descrbe the gven doman. For ths task, the envronment s dvded nto three man modules. The frst component receves the problem descrpton represented as a set of terms and allows the user to refne and enlarge t usng Word- Net. The second module apples multple automatc crtera to evaluate the ontologes of the repostory and detere whch ones ft best the problem descrpton. A ranked lst of ontologes s returned for each crteron, and the lsts are combned by means of rank fuson technques that combne the selected crtera. A thrd component of the system uses manual user evaluatons of the ontologes n order to ncorporate a human, collaboratve assessment of the qualty of ontologes. Categores and Subect Descrptors H.3.3 [Informaton Storage and Retreval]: Informaton Search and Retreval nformaton flterng, retreval models, selecton process. eneral Terms Algorthms, Measurement, Human Factors. Keywords ntology evaluaton, ontology reuse, rank fuson, collaboratve flterng, WordNet.. INTRDUCTIN The Semantc Web s envsoned as a new flexble and structured Web that takes advantage of explct semantc nformaton, understandable by machnes, and therefore classfable and sutable for sharng and reuse n a more effcent, effectve and satsfactory way. In ths vson, ontologes are proposed as the backbone technology to supply the requred explct semantc nformaton. Developng ontologes from scratch s a hgh-cost process that requres maor engneerng efforts, even for a medum-scale ontology. In order to properly face ths problem, we beleve effcent ontology reuse and evaluaton technques and methodologes are needed. The lack of approprate support tools, and the lack of automatc measurement technques for certan ontology features are often a barrer for the mplementaton of successful ontology reuse methods. In ths work, we present CRE, a Collaboratve ntology Reuse and Evaluaton system. Ths tool provdes automatc smlarty measures for comparng a certan problem or olden Standard to a set of avalable ontologes, retrevng not only those most smlar to the doman descrbed by the olden Standard, but the best rated ones by pror ontology users, accordng to the selected crtera. For smlarty assessment, a user of CRE selects a subset from a lst of comparson technques that the tool provdes. Based on ths, the tool retreves a ranked lst of ontologes for each crteron. Fnally, a unque rankng s defned by means of a global aggregated measure whch combnes the dfferent selected crtera, usng rank fuson technques []. nce the system retreves those ontologes closely related to the olden Standard, t supports an addtonal step n the evaluaton process, by mplementng a Collaboratve Flterng approach [2][4][9]. Snce some ontology features can only be assessed by humans, the last evaluaton step takes nto consderaton the manual feedback provded by users of the ontologes, to re-rank the lst of ontologes, thus retrevng not only the ontologes that best ft the olden Standard, but the most qualfed ones accordng to human evaluatons. The paper s organzed by the followng structure. In Secton 2 we present the relevant work related to our research; secton 3 descrbes the system archtecture; sectons 4 and 5 present the automatc evaluaton measures used by the system; and some conclusons are gven n secton RELATED WRK ur research addresses problems n three dfferent research areas, where we draw from pror related work. These are: ontology evaluaton and reuse, whch s the prmary goal of our work; rank fuson, whch s used to combne the ratngs provded by dfferent ontology evaluaton crtera; and collaboratve flterng, by whch we get further evaluaton measures for ontology features that are better assessed by human udgment. 2. ntology Evaluaton Dfferent methodologes for ontology evaluaton have been proposed n the lterature consderng the characterstcs of the ontologes and the specfc goals or tasks that the ontologes are ntended for. An overvew of ontology evaluaton approaches s presented n [2], where four dfferent categores are dentfed: Those that evaluate an ontology by comparng t to a olden Standard, whch may tself be an ontology [] or some other knd of representaton of the problem doman for whch an approprate ontology s needed.

2 Those that evaluate the ontologes by pluggng them n an applcaton, and measurng the qualty of the results that the applcaton returns [6]. Those that evaluate ontologes by comparng them to unstructured or nformal data (e.g. text documents [3]) whch represent the problem doman. Those based on human nteracton to measure ontology features not recognzable by machnes [0]. In each of the above approaches, a number of dfferent evaluaton levels mght be consdered to provde as much nformaton as possble. Several levels can be dentfed n the lterature: The lexcal level [3][][2] whch measures the qualty by comparng the words (lexcal entres) of the ontology wth a set of words that represent the problem doman. The taxonomy level [] whch consders the herarchcal connecton between concepts usng the s-a relaton. ther semantc relatons besdes herarchcal ones [6][8]. The syntactc level [7] whch consders the syntactc requrements of the formal language used to descrbe the ontology. Context or applcaton level [4] whch consders the context of the ontology, such as the ontologes that reference or are referenced by the one beng evaluated, or the applcaton t s ntended for. The structure, archtecture and desgn levels [0] whch take nto account the prncples and crtera nvolved n the ontology constructon tself. Table summarzes all these approaches [2]. Table. An overvew of approaches to ontology evaluaton Level Lexcal entres, vocabulary, concept, data Herarchy, taxonomy ther semantc relatons Context, applcaton Approach to evaluaton olden Standard Applcaton based Data Drven Assessment by humans X X X X X X X X X X X X Syntactc X X Structure, archtecture, desgn In the present paper, two novel evaluaton measures are proposed. The frst one s based on a olden Standard approach and the lexcal level measure proposed by Maedche and Staab []. The second one s based on assessment by humans n a collaboratve flterng approach. X X X 2.2 Rank Fuson Rank fuson has been a wdely addressed research topc n the feld of Informaton Retreval [][5][9]. ven a set of rankngs whch apply to a common unverse of nformaton obects, the task of rank aggregaton conssts of combnng ths lst n a way to optmze the performance of the combnaton. Examples where rank fuson takes place nclude, for nstance, metasearch [8] dstrbuted search from heterogeneous sources, personalzed retreval, classfcaton based on multple evdence, etc. Fuson technques typcally brng better recall, better precson, and more consstent performance than the ndvdual systems beng combned []. Fuson technques can be characterzed by: The nput data they requre: ranks, scores, or full nformaton of the obects. Whether or not tranng data s used, whch usually conssts of manual relevance udgments on the nformaton obects. The degree of overlap between the sets of rated obects, rangng from total overlap (a.k.a. data fuson), to completely dsont sets (a.k.a. collecton fuson), and arbtrarly overlappng. The applcaton level, whch can be a) external, f autonomous ratng systems are ntegrated nto a new meta layer, or b) nternal, f the combnaton takes place at heart of a retreval system, where dfferent subsystems collect evdence from several sources or dfferent crtera. In our work, rank fuson technques are used to combne the ndvdual ontology lsts retreved by partal evaluaton crteron nto an aggregated ontology rankng. Ths can be understood as a metasearch problem where a) the nput data are the evaluaton ratngs from dfferent crtera, b) no tranng data s used (there are no pror manual ratng or reference udgements for comparson), c) the overlap s complete (all the evaluaton crtera are appled on the same ontology repostory), and d) the level of applcaton s nternal (the ratng sources are components wthn the CRE system). 2.3 Collaboratve Flterng Collaboratve flterng strateges make automatc predctons (flter) about the nterests of a user by collectng taste nformaton from many users (collaboratng). Ths approach usually conssts of two steps: ) look for users that have a smlar ratng pattern to that of the actve user (the user for whom the predcton s done), and 2) use the ratngs of users found n step to compute the predctons for the actve user. These predctons are specfc to the user, dfferently to those gven by more smple approaches that provde average scores for each tem of nterest, for example based on ts number of votes. Collaboratve flterng s a wdely explored feld. Three man aspects typcally dstngush the dfferent technques reported n the lterature [4]: user profle representaton and management, flterng method, and matchng method. User profle representaton and management can be dvded nto fve dfferent tasks: Profle representaton. Accurate profles are vtal for the content-based component (to ensure recommendatons are approprate) and the collaboratve component (to ensure

3 that users wth smlar profles are n fact smlar). The type of profle chosen n ths work s the user-tem ratngs matrx (ontology evaluatons based on specfc crtera). Intal profle generaton. The user s not usually wllng to spend too much tme n defnng her/hs nterests to create a personal profle. Moreover, user nterests may change dynamcally over tme. The type of ntal profle generaton chosen n ths work s a manual selecton of values for only fve specfc evaluaton crtera. Profle learnng. User profles can be learned or updated usng dfferent sources of nformaton that are potentally representatve of user nterests. In our work, profle learnng technques are not used. The source of user nput and feedback to nfer user nterests from. Informaton used to update user profles can be obtaned n two dfferent ways: usng nformaton explctly provded by the user, and usng nformaton mplct observed n the user s nteracton. ur system uses no feedback to update the user profles. Profle adaptaton. Technques are needed to adapt the user profle to new nterests and forget old ones as user nterests evolve wth tme. Agan, n our approach profle adaptaton s done manually (manual update of ontology evaluatons). Flterng method. Products or actons are recommended to a user takng nto account the avalable nformaton (tems and profles). There are three man nformaton flterng approaches for makng recommendatons: Demographc flterng: Descrptons of people (e.g. age, gender, etc) are used to learn the relatonshp between a sngle tem and the type of people who lke t. Content-based flterng: The user s recommended tems based on the descrptons of tems prevously evaluated by other users. Content-based flterng s chosen approach n our work (the system recommends ontologes usng prevous evaluatons of those ontologes). Collaboratve flterng: People wth smlar nterests are matched and then recommendatons are made. Matchng method. Defnes how user nterests and tems are compared. Two man approaches can be dentfed: User profle matchng: People wth smlar nterests are matched before makng recommendatons. User profle-tem matchng: A drect comparson s made between the user profle and the tems. The degree of approprateness of the ontologes s computed by takng nto account prevous evaluatons of those ontologes. In CRE, a new ontology evaluaton measure based on collaboratve flterng s proposed, consderng user s nterest and prevous assessments of the ontologes. 3. SYSTEM ARCHITECTURE In ths secton we descrbe the archtecture of CRE, our Collaboratve ntology Reuse and Evaluaton envronment. Fgure shows the overvew of the system. We dstngush three dfferent modules. The frst one, the left module, receves the olden Standard defnton as a set of ntal terms and allows the user to modfy and extend t usng WordNet [3]. The second one, represented n the center of the fgure, allows the user to select a set of ontology evaluaton technques provded by the system to recover the ontologes closest to the gven olden Standard. The thrd one, or rght one, s a collaboratve module that re-ranks the lst of recovered ontologes, takng nto consderaton prevous feedback and evaluatons of the users. Fgure. CRE archtecture 3. olden Standard Defnton Phase The olden Standard Defnton module receves an ntal set of terms. These terms are supposed to be obtaned by an external Natural Language Processng (NLP) module from a set of documents related to the specfc doman n whch the user s nterested. Ths NLP module would receve the repostory of documents and return a lst of pars (lexcal entry, part of speech), that roughly represents the doman of the problem. Ths phase s part of future work. Here n our experments, the lst of ntal (root) terms has been manually assgned. The module allows the user to expand the root terms usng WordNet [3] and some of the relatons t provdes: hypernym, hyponym and synonym. The new terms added to the olden Standard usng these relatons mght also be extended agan and added to the problem defnton. The fnal representaton of the olden Standard can be defned as a set of terms T(L, PS, L P, R, Z) where: L s the set of lexcal entres defned for the olden Standard. PS corresponds to the dfferent Parts f Speech consdered by WordNet: noun, adectve, verb and adverb. L P s the set of lexcal entres of the olden Standard that have been extended. R s the set of relatons between terms of the olden Standard: synonym, hypernym, hyponym and root (f a term has not been obtaned by expanson, but s one of the ntal terms). Z s an nteger number that represents the depth or dstance of a term to the root term from whch t has been derved.

4 Fgure 2. CRE user nterface Example: T ( pzza, noun,, RT, 0). T s one of the root terms of the olden Standard. The lexcal entry that t represents s pzza, ts part of speech s noun, t has not been expanded from any other term so ts lexcal parent s the empty strng, ts relaton s RT and ts depth s 0. T 2 ( pzza pe, noun, pzza, Synonym, ). T 2 s a term expanded from T. The lexcal entry t represents s pzza pe, ts part of speech s noun, the lexcal entry of ts parent s pzza, t has been expanded by the synonym relaton and the number of relatons that separated t from the root term T s. The left part of Fgure 2 shows the nterface of the olden Standard Defnton phase. In the top level we can see the lst of root terms. The user s allowed to manually nsert new root terms gvng ther lexcal entres and selectng ther parts of speech. The correctness of these new nsertons s controlled by verfyng that all the consdered lexcal entres belong to the WordNet [3] repostory. In the bottom level we can see the fnal olden Standard defnton: the fnal lst of (root and expanded) terms that represent the doman of the problem. In the ntermedate level t can be seen how the user can make a term expanson. The user selects one of the prevous terms from the olden Standard defnton and the system shows hm all ts meanngs contaned n WordNet [3]. After he chooses one, the system automatcally presents hm three dfferent lsts wth the synonyms, hyponyms and hypernyms of the term. The user can choose one or more elements of these lsts and they wll automatcally be added to the expanded terms lst. For each expanson the depth of the new term s ncreased by one unt. Ths wll be used later to measure the mportance of the term wthn the olden Standard: the greater the depth of the derved term wth respect to ts root term, the less ts relevance wll be. 3.2 System Recommendaton Phase In ths phase the system should retreve the ontologes that better conceptualze the olden Standard doman. The mddle module of Fgure represents the structure of the recommendaton phase of the system. Frstly, the user selects a set of evaluaton crtera to be performed. After consderng the selected crtera and takng nto account the olden Standard and the ontologes of the repostory, the system retreves a ranked lst of ontologes (ordered by ther smlarty to the olden Standard) for each crteron. Then, all these lsts are merged usng rank fuson technques [] to obtan a global measure. The mddle part of Fgure 2 represents the user nterface of the System Recommendaton module. In the upper level we dstngush the crtera selecton phase. By now, two content evaluaton crtera can be selected to retreve the most smlar ontologes: ) the lexcal crteron, whch measures smlarty between the lexcal entres of the olden Standard and the lexcal entres of the ontologes and, 2) the taxonomc crteron, whch evaluates the herarchcal structure between them. The user can also select the relevance of each crteron n the rank aggregaton process, usng a range of dscrete values [, 2, 3, 4, 5], where symbolzes the lowest relevance value and 5 the hghest. Moreover, dfferent knds of lexcal and taxonomc smlarty measures have been mplemented and tested usng ths tool. These may now be selected n ths phase. These measures wll be explaned n secton 4 of ths document. The ntermedate level of Fgure 2 shows a dfferent ranked lst for each crteron and the fnal fused lst. In each of these tables, two dfferent ratngs are dsplayed for each ontology. The frst one refers to the smlarty between the ontology and the olden Standard. The second ratng, score, shows the smlarty value normalzed by the sum of all the values. The score measure exhbts the dstrbuton of the ratngs and allows us to better evaluate the dfferent technques.

5 nce the fnal ranked lst has been retreved, the system allows the user to select a subset of ontologes that he consders adequate for the Collaboratve Evaluaton Phase. 3.3 Collaboratve Evaluaton Phase Ths module has been desgned to confront the challenge of evaluatng those ontology features that are by ther nature, more dffcult for machnes to address. Where human udgment s requred, the system wll attempt to take advantage of Collaboratve Flterng technques [2][4][9]. Some approaches for ontology development [20] have been presented n the lterature concernng collaboraton technques. However to our knowledge, Collaboratve Flterng strateges have not yet been used n the context of ontology reuse. The collaboratve module ranks and presents the best ontologes for the user, takng nto consderaton prevous manual evaluatons. Several ssues have to be consdered n a collaboratve system. The frst one s the representaton of user profles. The type of user profle selected for our system s a user-tem ratng matrx (ontologes evaluatons based on specfc crtera). The ntal profle s desgned as a manual selecton of fve predefned crtera [5]: Correctness: specfes whether the nformaton stored n the ontology s true, ndependently of the doman of nterest. Readablty: ndcates the non-ambguous nterpretaton of the meanng of the concept names. Flexblty: ponts out the adaptablty or capablty of the ontology to change. Level of Formalty: hghly nformal, sem-nformal, semformal, rgorously-formal. Type of model: upper-level (for ontologes descrbng general, doman-ndependent concepts), core-ontologes (for ontologes descrbng the most mportant concepts on a specfc doman), doman-ontologes (for ontologes descrbng some doman of the world), task-ontologes (for ontologes descrbng generc types of tasks or actvtes) and applcaton-ontologes (for ontologes descrbng some doman n an applcaton-dependent manner). The above crtera can be dvded n two dfferent groups: ) the dscrete crtera (correctness, readablty and flexblty) that are represented by dscrete numerc values [0,, 2, 3, 4, 5] where 0 ndcates that the ontology does not fulfll the crteron, and 5 ndcates the ontology completely satsfes the crteron and, 2) the boolean crtera (level of formalty and type of model) are represented by a specfc value that s ether satsfed by the ontologes, or not. The collaboratve system does not mplement any profle learnng technque or relevance feedback to update user profles. But, the profles may be modfed manually. After the user profle has been defned, t s mportant to select an approprate type of flterng. For ths work, a contentbased flterng technque has been chosen; ths means, ontologes (our content tems) are recommended based on prevous users evaluatons. Fnally, a type of matchng must also be pcked out for the recommendaton process. In ths work, a novel technque of User Profle-Item matchng s proposed. To evaluate the levels of relevance of the ontologes, the technque wll make comparsons between the user s nterests and the ontology s evaluatons stored nto the system. Ths wll be explaned n secton 5. The rght porton of Fgure 2 shows the Collaboratve Evaluaton module. At the top level the user s nterest can be selected as a subset of crtera wth assocated values representng thresholds that manual evaluatons of the ontologes should fulfl. For example, when a user sets a value of 3 for the correctness crteron, the system recognzes that he s lookng for ontologes whose correctness value s greater than or equal to 3. nce the user s nterests have been defned, the set of manual evaluatons stored n the system s used to compute whch ontologes ft hs nterest best. The ntermedate level shows the fnal ranked lst of ontologes returned by the Collaboratve Flterng module. To add new evaluatons to the system, the user must select an ontology from the lst and choose one of the predetered values for each of the fve aforementoned crtera. The system also allows the user to add some comments to the ontology evaluaton n order to provde more feedback. ne more acton has to be performed n order to vsualze the evaluaton results of a specfc ontology. Fgure 3 shows the user s evaluaton module. n the left sde we can see the summary that the system provdes of the exstng ontology evaluatons wth respect to the user s nterest. In Fgure 3, 3 of 6 evaluatons of the ontology have fulflled the correctness crtera, 5 of 6 evaluatons have fulflled the readablty crtera, and so on. n the rght sde, we can see how the system enables the user to observe all the evaluatons stored nto the system about a specfc ontology. Ths may be of nterest snce we may trust some users more than others durng the Collaboratve Flterng process. Fgure 3. CRE user s evaluatons 4. CNTENT NTLY EVALUATIN In order to obtan smlartes between the olden Standard and the stored ontologes, two dfferent content ontology evaluaton levels have been consdered, the lexcal and the taxonomc. Several measures have been developed and tested for each level.

6 In the followng sectons we present the approaches that have shown better performance. 4. Lexcal Evaluaton Measures The lexcal evaluaton assesses the smlarty between the doman of the problem as descrbed by the olden Standard and an ontology by comparng the lexcal entres, or words that represent them. A new lexcal evaluaton measure based on Maetche and Staab work [] wll be explaned n ths secton. Some defntons must frst be ntroduced. Defnton (Lexcal entry). A lexcal entry l represents a strng or word. Defnton 2 (olden Standard Lexcon). The olden Standard Lexcon, L s defned by the set of lexcal entres extracted from the terms of the olden Standard, where each term has a sngle lexcal entry that represents t. Defnton 3 (ntology Lexcon). The ntology Lexcon, s defned as the set of lexcal entres extracted from the Concepts of the ntology. Each concept s represented by one or more lexcal entres that are extracted from the concept name, the rdfs:label property value, or other propertes that could be added to the lexcal extracton process consderng the characterzaton of each ontology. Defnton 4 (Levenshten dstance). The Levenshten dstance, ed( l, l ) between two lexcal entres l and l measures the mum number of token nsertons, deletons and substtutons to transform l nto l usng a dynamc algorthm. Example: ed(" pzzape"," pzza _ pe ") = Maedche and Staab [] propose a lexcal smlarty measure for strngs called Strng Matchng. Ths method compares two lexcal entres l, takng nto account the Levenshten dstance aganst the shortest lexcal entry. ( l, l ) ed( l, l ) SM ( l, l ) = max(0, ) [0,] ( l, l ) SM returns a degree of smlarty between 0 and, where 0 s a null match and represents a perfect match. Example: SM( pzzape, pzza_pe ) = 7/8. Based on the Strng Matchng they propose a lexcal smlarty measure to compare an ontology to a olden Standard, by computng the average strng matchng between the set of olden Standard lexcal entres and the set of ontology lexcal entres: SM ( L, L ) = max (, ) SM l l L l L l L SM ( L, L ) s an asymmetrc measure that deteres the extent to whch the lexcal level of the olden Standard s covered by the lexcal level of the ntology. Future work must be done n order to penalze those ontologes whch contan all the strngs of the olden Standard but also many others. L There s one prncple dfference between that approach and ours; Maedche defnes the olden Standard as an ontology, whle we use our own model. Ths fact provdes us wth the capablty to use all the addtonal nformaton stored n the olden Standard n order to mprove content evaluaton measures. When a doman s modeled as a set of lexcal entres, some lexcal entres have greater relevance when defnng the semantcs than do others. Assug ths characterstc we have decded to dstngush the mportance of the olden Standard terms. The root terms are consdered the most representatve ones whle the relevance of the expanded terms depends on the number of relatons that separate them from a root term. Wth ths modfcaton we emphasze the man semantcs and relegate the complementary ones nto the background. In ths work we defne the olden Standard Lexcal weght measure to evaluate the mportance of each term. Defnton 5 (olden Standard lexcal weght). ven a lst of lexcal entres L = { l } expanded from a common root lexcal entry, we defne the weght of l L as: max ( Depth( l)) Depth( l) + [, 2] f L > wl () = max ( Depth( l)) 2 otherwse The value returned s represented as a degree of relevance between (the farthest dstance to the root lexcal entry), and 2 (no dstance to the root lexcal entry). If the root lexcal entry has not been expanded we assgn t the weght value 2. Fgure 4 shows an example of ths measure, where T s the root term and consequently has the greater weght. T 3 s the most remote term and t has the smaller weght. The ntermedate terms lke T 2 have a weght between the maxmum and the mum relatve to ther dstance from the root term. Fgure 4. olden Standard lexcal weght measure In our approach, we have modfed the prevous lexcal measure takng nto account the weght or relevance of each term to represent the semantcs of the doman. SM ( L, L ) = max SM( l, l) w( l) L l Lo l L Through our experments, ths new measure has been shown to better dscrate the ontologes, gvng a hgher smlarty value to the ontologes that are closer to the olden Standard and lower ratng to the ontologes that worst ft the problem doman. Future work s needed n order to gve more or less relevance to the derved terms of the olden Standard usng not only ther dstances to the root terms but also, the knd of relaton from whch they have been derved, synonym, hypernym or hyponym.

7 4.2 Taxonomc Evaluaton Measures The taxonomc evaluaton assesses the degree of overlappng between the herarchcal structure of the ontology, defned by the s-a relaton and the olden Standard structure, defned by the dervatons of terms to complete the doman representaton. The followng notatons and defntons wll be used to defne our measure: T C T represents a olden Standard term. C represents an ntology concept. Defnton 8 (Semantc Cotopy of a olden Standard Term). The Semantc Cotopy of a olden Standard term SC( T ) s defned as the set of lexcal entres of the terms derved from the same root term as T, ncludng the lexcal entres of T. Defnton 9 (Semantc Cotopy of an ntology Concept). The Semantc Cotopy of an ntology concept SC( C ) s defned as the set of lexcal entres of the concepts related wth C n the ontology wth a drect relaton, ncludng the lexcal entres of C. ven Maedche and Staab [] measure, an adaptaton s performed to obtan a smlarty between an ontology Concept and a olden Standard Term relatve to the new olden Standard defnton. The smlarty s computed as the ntersecton between the Semantc Cotopy of the olden Standard term and the Semantc Cotopy of the ontology concept normalzed by the total possble overlap. SC( T ) SC( C ) TS( T, C ) = SC( T ) SC( C ) In order for two lexcal entres to be consdered a match, ther smlarty must be greater than a threshold emprcally estmated as 0.2. For smlartes below ths value we have observed there s no sgnfcant morphologcal resemblance between terms. The taxonomc smlarty measure consders all the overlaps between the ntology and the olden Standard. In order to optmze the evaluaton, only a subset of terms and concepts are used to assess the taxonomc smlarty. Ths subset s obtaned through the lexcal measurement, ths s done by selectng only the terms and concepts that have matched wth a smlarty value greater than 0.2. TS( T, C ) = TS( T, C ) T T T, C C ^ l T, l C : SM( l, l) > CLLABRATIVE FILTERIN FR NTLY REUSE In ths secton, a new automatc evaluaton measure that explots the advantages of Collaboratve flterng s proposed. It wll match the set of ontologes or tems that better fulfll the user s nterest explorng the set of manual evaluaton stored nto the system. As we explaned n secton 3 user s evaluatons are represented lke a set of fve defned crtera and ther respectve values manually detered by the user who makes the evaluaton. n the other hand, user s nterests are expressed lke a subset of those crtera, and ther respectve values, meanng a threshold or restrcton to be satsfed by user s evaluatons. Two man steps are presented for ths measure. The frst one descrbes how the smlarty degree between a user s evaluaton crteron and a user s nterest threshold for the same crteron s assessed. The second one descrbes how calculate the fnal rankngs of the ontologes. 5. Collaboratve Evaluaton Measures As we explaned n secton 3.3, the user evaluaton about a specfc ontology s made consderng fve dfferent crtera. These fve crtera are dvded n two dfferent groups: ) the dscrete crtera (correctness, readablty and flexblty), whch take dscrete numerc value [0,, 2, 3, 4, 5], where 0 means that the ontology does not fulfll the crteron, and 5 means the ontology completely satsfy the crteron, and 2) the boolean crtera (level of formalty and type of model) that are represented by specfc values that can be or not satsfed by the ontology. User s nterests are defned lke a subset of those crtera and ther respectve values representng a set of thresholds that the ontologes should fulfll. The user s nterests are szed up aganst the respectve values of those crtera n the user s evaluatons or user s profles. For the boolean case, a value of 0 s returned f the value of the crteron n n the evaluaton m does not fulfll the user s requrements for that crteron, and 2 otherwse. smlarty bool ( crteron ) = 0 f evaluaton 2 f evaluaton threshold = threshold For the dscrete case, the measure ncludes dfferent aspects: a smlarty assessment and a penalty assessment. The smlarty assessment s based on the dstance between the value of the crteron n nto the evaluaton m, and the threshold specfed n the user s nterest for that crteron. The more the value of the crteron n n evaluaton m overcomes the threshold specfed for ths crteron, the greater the smlarty value s. The penalty assess consders how dffcult s to surpass ths threshold. The more dffcult to surpass the threshold, the lower the penalty value s. smlartynum( crteron) = * = + smlartynum( crteron) penaltynum( threshold) Ths measure also returns values between 0 and 2. The consderaton of retrevng a smlarty value between 0 and 2 has taken from other collaboratve matchng measures [9] to not manage negatve numbers. In the case of ths collaboratve measure, negatve smlarty values would be returned when the value of the crteron n the user s evaluatons does not surpass the threshold requred n the user s nterests. 5.2 Collaboratve Evaluaton Rankng The user s nterests and the user s profles, or evaluatons of the ontologes stored nto the system, are used to make the fnal rankng of the ontologes. The smlarty between an ontology evaluaton and the user s requrements s measured as the average of ts N crtera smlartes. N smlarty( evaluaton = m ) smlarty( N crteron ) n=

8 The smlarty of a specfc ontology to the user s requrements s measured as the average of the M evaluatons smlartes for that specfc ontology. M smlarty( ontology) = smlarty( evaluatonm) M m= M N = smlarty( crteron) MN m= n= In case of tes, the fnal collaboratve rankng sorts the ontologes takng nto account not only the average smlarty between the ontologes and the evaluatons stored nto the system, but also the total number of evaluatons of those ontologes, provdng more relevance to those ontologes that have been rated more tmes. M M total smlarty ( ontology ) 6. CNCLUSINS AND FUTURE WRK In ths work a new tool for ontology evaluaton and reuse have been presented, ncludng some nterestng features lke a new olden Standard model, new lexcal evaluaton crtera, the use of rank fuson technques to combne dfferent content ontology evaluaton measures, and the use of a novel Collaboratve flterng strategy to take advantage of user s opnons n order to automatcally evaluate features that only can be assessed by humans. Some ntal experments, not explaned n ths paper, have been developed usng a set of ontologes form the Protégé WL repostory [7] obtanng postve results, but a more detaled and rgorously expermentaton must be done n order to acheve relevant conclusons. 7. ACKNWLEDMENTS Thanks to Enrco Motta, the great drector of the SSSW2005, Aldo angem and Elke Mchlmayr, also members of ths fantastc School, for our 2 a.m. conversatons about ontology evaluaton. Thanks to Alexander omperts for hs help revewng the paper, and specal gratefulness to Denny Vrandecc for encourage us to do ths work. Ths research was supported by the Spansh Mnstry of Scence and Educaton (TIN ). 8. REFERENCES [] Aslam, J. A., Montague, M. Models for metasearch. 24th Annual Internatonal ACM SIIR Conference on Research and Development n Informaton Retreval (SIIR 200). New rleans, Lousana, 200, pp [2] Brank J., robelnk M., Mladenć D. A survey of ontology evaluaton technques. SIKDD 2005 at multconference IS 2005, 7 ct 2005, Lublana, Slovena. [3] Brewester, C. et al. Data drven ontology evaluaton. Proceedngs of Int. Conf. on Language Resources and Evaluaton, Lsbon, [4] Dng, L., et al., Swoogle: A search and metadata engne for the semantc web. Proc. CIKM 2004, pp [5] Fox, E. A., Koushk, M. P., Shaw, J., Modln, R., Rao, D. Combnng evdence from multple searches. st Text REtreval Conference (TREC ). athersburg, Maryland, March 992, pp [6] angem, A., Catenacc, C., Caramta, M., Lehmann, J. A Theoretcal Framework for ntology Evaluaton and Valdaton. In Proceedngs of SWAP2005. [7] omez-perez, A. Some Ideas and Examples to Evaluate ntologes. In Proceedng of the th Conference on Artfcal Intellgence. Los Angeles, CA, February, pp , 995. [8] uarno, N., Welty, C. Evaluatng ntologcal Decsons wth ntoclean. Communcatons of the ACM. 45(2):6-65. New York: ACM Press, [9] Lee, J. H. Analyses of multple evdence combnaton. 20th ACM SIIR Conference on Research and Development n Informaton Retreval (SIIR 97). New York, 997, pp [0] Lozano-Tello, A., ómez-pérez, A. ntometrc: A method to choose the approprate ontology. J. Datab. Mgmt., 5(2): 8 (2004). [] Maedche, A., Staab, S. Measurng smlarty between ontologes. Proc. CIKM LNAI vol. 2473, pp [2] Masthoff J. roup modelng: Selectng a Sequence of Televson Items to Sut a roup of Vewers. User Modelng and User-Adapted Interacton 4: 37-85, [3] Mller,. WordNet: A lexcal database. Communcatons of the ACM, 38(): [4] Montaner M., López B., De la Rosa J.L. A Taxonomy of Recommended Agents on the Internet. Artfcal ntellgence Revew 9: , [5] Paslaru, E. Usng Context Informaton to Improve ntology Reuse. Doctoral Workshop at the 7th Conference on Advanced Informaton Systems Engneerng CASE'05. [6] Porzel, R., Malaka, R. A task-based approach for ontology evaluaton. ECAI 2004 Workshop nt. Learnng and Populaton. [7] Protégé WL ontology Repostory. protege.stanford.edu/plugns/owl/owl-lbrary/ndex.html [8] Renda, M. E., Stracca, U. Web metasearch: rank vs. score based rank aggregaton methods. ACM symposum on Appled Computng. Melbourne, Florda, 2003, pp [9] Resnck P. et al. rouplens: An pen Archtecture for Collaboratve Flterng of Netnews. Internal Research Report, MIT Center for Coordnaton Scence, March 994. [20] Sure Y., Erdmann M., Angele J., Staab S., Studer R., Wenke D. ntoedt: Collaboratve ntology Development for the Semantc Web. ISWC [2] Velard, P., et al. Evaluaton of ntolearn, a methodology for automatc learnng of doman ontologes. In nt. Learnng from Text: Methods, Evaluaton and Applcatons, IS Press, 2005.

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

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

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

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

User Authentication Based On Behavioral Mouse Dynamics Biometrics

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

More information

Query Clustering Using a Hybrid Query Similarity Measure

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

More information

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

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

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

More information

A 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

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

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

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

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

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

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

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: 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

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

Ontology Mapping: As a Binary Classification Problem

Ontology Mapping: As a Binary Classification Problem Fourth Internatonal Conference on Semantcs, Knowledge and Grd Ontology Mappng: As a Bnary Classfcaton Problem Mng Mao SAP Research mng.mao@sap.com Yefe Peng Yahoo! ypeng@yahoo-nc.com Mchael Sprng U. of

More information

(1) The control processes are too complex to analyze by conventional quantitative techniques.

(1) The control processes are too complex to analyze by conventional quantitative techniques. Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a

More information

Mathematics 256 a course in differential equations for engineering students

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

More information

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

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

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

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

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

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

Combining Multiple Resources, Evidence and Criteria for Genomic Information Retrieval

Combining Multiple Resources, Evidence and Criteria for Genomic Information Retrieval Combnng Multple Resources, Evdence and Crtera for Genomc Informaton Retreval Luo S 1, Je Lu 2 and Jame Callan 2 1 Department of Computer Scence, Purdue Unversty, West Lafayette, IN 47907, USA ls@cs.purdue.edu

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

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

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

More information

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

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

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

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

Load Balancing for Hex-Cell Interconnection Network

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

More information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

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

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

The Research of Support Vector Machine in Agricultural Data Classification

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

More information

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

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

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

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

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

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

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

More information

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

Keywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines

Keywords - Wep page classification; bag of words model; topic model; hierarchical classification; Support Vector Machines (IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Herarchcal Web Page Classfcaton Based on a Topc Model and Neghborng Pages Integraton Wongkot Srura Phayung Meesad Choochart Haruechayasak

More information

Description of NTU Approach to NTCIR3 Multilingual Information Retrieval

Description of NTU Approach to NTCIR3 Multilingual Information Retrieval Proceedngs of the Thrd NTCIR Workshop Descrpton of NTU Approach to NTCIR3 Multlngual Informaton Retreval Wen-Cheng Ln and Hsn-Hs Chen Department of Computer Scence and Informaton Engneerng Natonal Tawan

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

More information

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

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

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

More information

Object-Based Techniques for Image Retrieval

Object-Based Techniques for Image Retrieval 54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the

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

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

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

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

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

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

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

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

More information

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

Federated Search of Text-Based Digital Libraries in Hierarchical Peer-to-Peer Networks

Federated Search of Text-Based Digital Libraries in Hierarchical Peer-to-Peer Networks Federated Search of Text-Based Dgtal Lbrares n Herarchcal Peer-to-Peer Networks Je Lu School of Computer Scence Carnege Mellon Unversty Pttsburgh, PA 15213 jelu@cs.cmu.edu Jame Callan School of Computer

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

Feature Selection as an Improving Step for Decision Tree Construction

Feature Selection as an Improving Step for Decision Tree Construction 2009 Internatonal Conference on Machne Learnng and Computng IPCSIT vol.3 (2011) (2011) IACSIT Press, Sngapore Feature Selecton as an Improvng Step for Decson Tree Constructon Mahd Esmael 1, Fazekas Gabor

More information

Personalized Information Retrieval Approach

Personalized Information Retrieval Approach 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,

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

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

Improving Web Image Search using Meta Re-rankers

Improving Web Image Search using Meta Re-rankers VOLUME-1, ISSUE-V (Aug-Sep 2013) IS NOW AVAILABLE AT: www.dcst.com Improvng Web Image Search usng Meta Re-rankers B.Kavtha 1, N. Suata 2 1 Department of Computer Scence and Engneerng, Chtanya Bharath Insttute

More information

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,

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

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Analysis of Continuous Beams in General

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

More information

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

FINDING IMPORTANT NODES IN SOCIAL NETWORKS BASED ON MODIFIED PAGERANK

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

More information

Visual Thesaurus for Color Image Retrieval using Self-Organizing Maps

Visual Thesaurus for Color Image Retrieval using Self-Organizing Maps Vsual Thesaurus for Color Image Retreval usng Self-Organzng Maps Chrstopher C. Yang and Mlo K. Yp Department of System Engneerng and Engneerng Management The Chnese Unversty of Hong Kong, Hong Kong ABSTRACT

More information

Private Information Retrieval (PIR)

Private Information Retrieval (PIR) 2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market

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

Extraction of User Preferences from a Few Positive Documents

Extraction of User Preferences from a Few Positive Documents Extracton of User Preferences from a Few Postve Documents Byeong Man Km, Qng L Dept. of Computer Scences Kumoh Natonal Insttute of Technology Kum, kyungpook, 730-70,South Korea (Bmkm, lqng)@se.kumoh.ac.kr

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Document Representation and Clustering with WordNet Based Similarity Rough Set Model

Document Representation and Clustering with WordNet Based Similarity Rough Set Model IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 5, No 3, September 20 ISSN (Onlne): 694-084 www.ijcsi.org Document Representaton and Clusterng wth WordNet Based Smlarty Rough Set Model

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

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

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

More information

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

A Misclassification Reduction Approach for Automatic Call Routing

A Misclassification Reduction Approach for Automatic Call Routing A Msclassfcaton Reducton Approach for Automatc Call Routng Fernando Uceda-Ponga 1, Lus Vllaseñor-Pneda 1, Manuel Montes-y-Gómez 1, Alejandro Barbosa 2 1 Laboratoro de Tecnologías del Lenguaje, INAOE, Méxco.

More information

11. HARMS How To: CSV Import

11. HARMS How To: CSV Import and Rsk System 11. How To: CSV Import Preparng the spreadsheet for CSV Import Refer to the spreadsheet template to ad algnng spreadsheet columns wth Data Felds. The spreadsheet s shown n the Appendx, an

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

KIDS Lab at ImageCLEF 2012 Personal Photo Retrieval

KIDS Lab at ImageCLEF 2012 Personal Photo Retrieval KD Lab at mageclef 2012 Personal Photo Retreval Cha-We Ku, Been-Chan Chen, Guan-Bn Chen, L-J Gaou, Rong-ng Huang, and ao-en Wang Knowledge, nformaton, and Database ystem Laboratory Department of Computer

More information

Unsupervised Learning

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

More information

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

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

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

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

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

Intelligent Information Acquisition for Improved Clustering

Intelligent Information Acquisition for Improved Clustering Intellgent Informaton Acquston for Improved Clusterng Duy Vu Unversty of Texas at Austn duyvu@cs.utexas.edu Mkhal Blenko Mcrosoft Research mblenko@mcrosoft.com Prem Melvlle IBM T.J. Watson Research Center

More information

SEMANTIC SEARCH OF INTERNET INFORMATION RESOURCES ON BASE OF ONTOLOGIES AND MULTILINGUISTIC THESAURUSES. Anatoly Gladun, Julia Rogushina

SEMANTIC SEARCH OF INTERNET INFORMATION RESOURCES ON BASE OF ONTOLOGIES AND MULTILINGUISTIC THESAURUSES. Anatoly Gladun, Julia Rogushina 48 SEMANTIC SEARCH OF INTERNET INFORMATION RESOURCES ON BASE OF ONTOLOGIES AND MULTILINGUISTIC THESAURUSES Anatoly Gladun, Jula Rogushna Abstract: the approaches to the analyss of varous nformaton resources

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

A Fuzzy Image Matching Algorithm with Linguistic Spatial Queries

A Fuzzy Image Matching Algorithm with Linguistic Spatial Queries Fuzzy Matchng lgorthm wth Lngustc Spatal Queres TZUNG-PEI HONG, SZU-PO WNG, TIEN-HIN WNG, EEN-HIN HIEN epartment of Electrcal Engneerng, Natonal Unversty of Kaohsung Insttute of Informaton Management,

More information

CS47300: Web Information Search and Management

CS47300: Web Information Search and Management CS47300: Web Informaton Search and Management Prof. Chrs Clfton 15 September 2017 Materal adapted from course created by Dr. Luo S, now leadng Albaba research group Retreval Models Informaton Need Representaton

More information

Feature-Based Matrix Factorization

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

More information