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

Size: px
Start display at page:

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

Transcription

1 Rules for Usng Mult-Attrbute Utlty Theory for Estmatng a User s Interests Ralph Schäfer 1 DFKI GmbH, Stuhlsatzenhausweg 3, Saarbrücken Ralph.Schaefer@dfk.de Abstract. In ths paper, we show that Mult-Attrbute Utlty Theory (MAUT), a prescrpton for evaluatng objects, can be ascrbed as evaluaton process to a user when estmatng the user s nterests. Some rules are proposed for the applcaton of MAUT. Keywords: User s nterests, MAUT, evaluaton scheme 1 Usng MAUT for Estmatng Varous Interests of a User Estmaton of a user s nterests n recommender systems s very mportant, because these nterests are the bass of the system s recommendatons. There are many approaches for estmatng the user s nterest n the user modellng area. One approach s to ascrbe the user Mult-Attrbute Utlty Theory, abbrevated as MAUT, (see [WE86]) as evaluaton process. There are many approaches for estmatng the user s nterest and a great number of them do not explctly menton usng MAUT. Wthn ths paper, we wll have a detaled look at some of these approaches and examne the followng ssues: Can MAUT be used as common denomnator of these approaches (although MAUT s not explctly mentoned n the descrptons of these approaches)? Is t possble to defne rules descrbng how to apply MAUT for estmatng the user s nterests? For answerng these questons, we sketch out MAUT n Secton 2. The followng Secton 3 summarses a selecton of recent approaches whch estmate the user s nterests and Secton 4 proposes some rules for usng MAUT. 2 Mult-Attrbute Utlty Theory (MAUT) Mult-Attrbute Utlty Theory s an evaluaton scheme whch s very popular by consumer organsatons for evaluatng products. For example, n Germany Stftung Warentest uses MAUT (see for example [St00]). 2 Accordng to MAUT, the overall evaluaton v(x) of an object x s defned as a weghted addton 3 of ts evaluaton wth respect to ts relevant value dmensons [WE86]. The common denomnator of all these dmensons s the utlty for the evaluator. For example, a dgtal camera can be evaluated on the value dmensons qualty of mage, flash, 1 Ths work has been supported by the EC through ts IST-Programme under contract IST CAWICOMS (see for addtonal nformaton). 2 For supportng a person n evaluatng an object by usng MAUT, one could use sophstcated vsualzaton tools, but these thngs are out of scope of ths artcle. 3 There are other possbltes for aggregaton whch are descrbed by [WE86].

2 vewfnder, operaton tme, and handlng (see [St00]). The overall evaluaton s defned by the followng overall value functon: v( x) = n = 1 w v ( x) Here, v (x) s the evaluaton of the object on the -th value dmenson d and w the weght determnng the mpact of the -th value dmenson on the overall evaluaton (also called the relatve mportance of a dmenson 4 ), n s the number of dfferent value n = 1 dmensons, and w = 1. For each value dmenson relevant attrbutes: 5 d the evaluaton v (x) s defned as the evaluaton of the v ( x) = w v ( l( a)) a A Here, A s the set of all attrbutes relevant for d, v a ( l( a)) s the evaluaton of the actual level l(a) of attrbute a on d. w a s the weght determnng the mpact of the evaluaton of attrbute a on value dmenson d. w a s also called relatve mportance of attrbute a for d. For all d (=1,...,n) holds w a = 1. a a a A For example, for the qualty of mages, we have to consder attrbutes such as sharpness, colour reproducton, and resoluton, whereas for operaton tme, we only have a sngle attrbute, actual operaton tme, whch reflects how long the camera can be operated. In order to evaluate attrbutes, t s necessary to construct a scale representng the propertes of the levels of an attrbute. A scale from 0 (worst) to 10 (best) serves as measure of the evaluaton. 6 Very often there s already a natural scale for the levels of the attrbutes. For example, for the resoluton, we can defne that 4 megapxel or more s best (10 ponts) whereas 0 megapxel s worst (0 ponts) (see Fgure 1). 10 VALUE RESOLUTION IN MEGAPIXEL Fgure 1: Example of a value functon Dependng on the attrbute, the evaluaton functon looks dfferent. If t s a contnuous varable, the evaluaton functon also wll be a contnues one, f t s a dscrete varable, the functon wll be dscrete. There s also the possblty to use value functons of 4 The relatve mportance of a dmenson also expresses the relevance of a dmenson for the overall evaluaton. 5 There could be also subdmensons nvolved. In ths case, the evaluaton of the object on a dmenson would be defned smlar to the overall evaluaton, by a weghted addton of the evaluaton of the object wth respect to ts subdmensons. 6 The boundares of ths scale can be selected to another values, e.g. [0..1], f one prefers another scale.

3 dfferent shape, for example logarthmc ones, tr-partte ntervals (not necessarly of equal length) or even user dependent scales. However, usually t s a good dea to use the smplest model possble for the doman for reasons of transparency (cf. Secton 4.1.2). Table 1 shows an example of the evaluatons of the attrbutes of two dfferent cameras whch are relevant for the dmenson qualty of mages. Accordng to Table 1, camera CA s evaluated on qualty of mages as follows: 10 * 0,4 + 5 *0,3 +5 * 0,3 = 0,7 For camera CB, the evaluaton s done accordngly. The evaluatons of the cameras on ther relatve value dmensons are summarsed n Table 2. Attrbute Evaluaton of attrbute of camera CA Evaluaton of attrbute of camera CB Sharpness ,4 Colour reproducton ,3 Resoluton ,3 Relatve weght on dmenson qualty of mages Table 1: Evaluaton of attrbutes and relatve weghts for dmenson qualty of mages Evaluaton of Products Dmenson CA CB Qualty of mage 7 10 Flash 10 1 Vewfnder 5 9 Operaton tme 10 2 Handlng 9 3 Table 2: Examples for evaluatons of dgtal cameras on ther evaluaton dmensons Dmenson Preferences (LP) Preferences (SP) Qualty of mage 0,4 0,8 Flash 0,04 0,00 Vewfnder 0,1 0,1 Operaton tme 0,4 0,05 Handlng 0,06 0,05 Table 3: Examples for user preferences In Table 3 the preferences of two dfferent persons are depcted. A studo photographer (SP) wants to make excellent pctures. There s no need for a long operaton tme, because rechargng of batteres can be done easly and he never needs a flash. A landscape photographer (LP) who goes on long-term journeys (for example hkng n deserted areas) manly wants to have a camera whch has a long operaton tme snce s/he wll not be able to transport very many batteres. So, LP wll prefer CA whereas SP wll prefer CB (see Table 4). LP SP CA 8,24 7,05 CB 5,92 9,15 Table 4: Overall evaluatons of cameras CA and CB for persons LP and SP

4 Stftung Warentest uses MAUT over many years n order to evaluate products and presentng them to the publc. Even newspapers prnt the results n a shortened form, by publshng the value dmensons, the evaluaton of the products wth respect to these dmensons and the overall evaluaton of the products. Ths ndcates that an evaluaton accordng to MAUT can be easly understood. However, t should be noted that t s not trval to dentfy the value dmensons of an object and of all attrbutes beng relevant for the evaluaton. Of course, t s much easer to understand them, once they have been defned. Ths s probably the reason why people use more smpler evaluaton schemes when evaluatng objects or just rely on the schemes of consumer organsatons whch they do understand. In the followng, we wll examne some approaches for estmatng the user s nterest and examne whether the used evaluaton scheme wll be compatble wth MAUT. 3 Approaches for Estmatng the User s Interest [EMM+01] present a system for news classfcaton n the World Wde Web. The task of the system s to flter news for a sngle user. As seen from the vew pont of MAUT, the system has to determne the utlty of a gven artcle,.e. whether t s nterestng to the user or not. In the begnnng, the user selects some categores from an ontology and assgns a relevance value to them. A news tem s rated accordng to ts relevance wth respect to categores, keywords, and resource channels. From a smplfed vewpont, the user has defned nterest dmensons by specfyng the categores whch are of nterest to hm. An artcle s useful, f t s nterestng whch means that t falls n one of the selected categores. The value functons are equvalent wth the functon descrbng whether an artcle belongs to such a category or not. However, n ths case t s not as smple as descrbed n ths text, because the offered categores do not match perfectly wth the user s nterest dmensons: usually, they are too general. For ths reason, keywords and resource channels are also used by the system of [EMM+01] for flterng the news artcles. The weghts whch also determne how relevant,.e. nterestng, a news tem s for the user, depend on (among other thngs) the relevance values assgned by the user. [KOY01] presents a system whch s able to learn the user s preferences for schedulng meetngs. The nterests to be learned are varables such as duraton, day-of-week, locaton, and start-tme (regardng specfc types of meetng). The system learns the user s preferences through routne use whch enables t to gve customsed schedulng advce. [KOY01] even assumes that the nterests of the user slghtly change over tme. From the vewpont of MAUT, we have, n ths case, a flat herarchy. There are only attrbutes, but no ntermedate value dmensons. For the attrbutes the value functons are dfferent for each user. For example, the locatons of the meetngs regardng a specfc type of meetng dffer from user to user. Koychev s system therefore tres to learn the value functons of the user. The weghts of the evaluaton functon are not consdered, because the system tres to predct the perfect combnaton [LHL97] use a canddate crtque model for nteractve problem solvng. In ths approach, an automated problem solver presents canddate solutons to the user who gves feedback on these solutons. Based on ths feedback, better solutons are searched and presented to the user.

5 The presented system s desgned as constrant-based system and the use of MAUT s not obvous. However, for dentfyng the best soluton n the user model preferences such as prefers fewer stops are represented whch can be seen as value functons. By usng the canddate crtque model, the system s not oblged to represent the user s evaluaton process, because t s the user who evaluates the objects. However, mplctly the system s learnng the user s value functon, e.g. whether the user prefers more or less stops or whch are the user s most preferred arlnes. In the same way, the weghts are learned: f there s no soluton whch matches to all the user s needs, the user has to decde whether to prefer a soluton whch fulfls hs requrements regardng attrbute A, but not B or the other way round. In the frst case, the user expresses a greater weght for attrbute A than B. [CP01] explctly uses MAUT for travel plannng. So, t s clear that the approach s compatble wth MAUT. Stereotypcal nformaton s used for not havng to ask the user about all detals. 4 Rules for Choosng the Rght Complexty of MAUT We have seen that all examned approaches n Secton 3 ascrbe an evaluaton process to the user whch s compatble wth MAUT. It seems therefore not to be an ssue whether to use MAUT or not, but to decde whch complexty of MAUT to apply. There are many degrees at whch complexty can be vared. In the followng, rules are proposed for selectng a proper degree of complexty. 4.1 Rules Herarchy of dmensons and attrbutes Descrpton: In the smplest case, there are only attrbutes (cf. Secton 2) and no hgher level dmensons (such as the d n Secton 2) whch have been assgned weghts. More complex models nvolve a herarchy of dmensons and subdmensons. Rule: There are two factors whch determne the herarchy: The applcaton doman: If there are very few attrbutes or f the attrbutes cannot be subsumed n a herarchy, then a non-herarchcal model has to be chosen. Use of the model wthn the applcaton: If your doman allows to ntroduce a herarchy to model the objects to be evaluated, t depends on the elctaton and presentaton goals of your applcaton what to use. If t s suffcent, to ask the user about the attrbutes and present them (n contrast to askng / presentng) hgher level concepts, then a flat herarchy may be chosen whch just conssts of attrbutes but not of dmensons Assumpton of gven weghts and value functons Descrpton: Snce t s possble that every user has ts own value functons and weghts, on the one hand, one approach s to try to estmate all these parameters for each user. On the other hand, one could assume some of these parameters as fxed and only estmate a part of them. Rule: If there s no doubt about the parameter s value, there s no use n tryng to estmate them. However, n most cases t s not that smple, but there s a hgh

6 number of a value functons whch are agreed regardng ther basc meanng. For example, nearly everybody agrees that a low prce s better than a hgh prce. In a smplfcaton, the weghts of attrbutes n the lower levels of a herarchy also can be assumed as fxed. Whch parameters of these should be assumed as fx depends on how much doubt about the actual value of ths parameters (.e. attrbute weght and values functons) you have and whether t s possble to elct the actual values of these parameters. There may be a trade-off between these crtera. So, t can only be decded for each applcaton separately. For example, even f there s some doubt about value functons and attrbute weghts, t may be reasonable to choose them as fx, because the doman s so complex that t s not feasble to ask the user about all of them Complexty of aggregaton functon Descrpton: Besdes the weghted addton as aggregaton functon whch were ntroduced here, there are more complex aggregaton functons. It s possble to derve such functon on ts own, for example for ntroducng non-compensatory factors. Rule: Keep t smple! The complexty of the aggregaton functon depends on the applcaton doman, but t should be chosen as the smplest possble functon. 4.2 Applcaton example Wthn the IST-project CAWICOMS 7 (see [CC00]) a confguraton workbench s beng developed for confgurng complex products. The nterface of ths workbench has the task to support the user n choosng parameters whch match the user s needs. Example domans are the confguraton of complex telecommuncaton swtches and IP-VPNs. In order to help the user, the system proposes default parameter values and even sets parameter values for the user. For ths purpose the user s ascrbed MAUT as evaluaton process (see [SM01]) The followng desgn decsons have been taken: Herarchy of dmensons: snce the products to be confgured are qute complex, the user cannot defne every detal. For ths purpose, the evaluaton scheme conssts not only of attrbutes but also of dmensons. In ths way, the user can be asked about hs/her nterests regardng these dmensons. Based on ths nformaton, parameter values can be selected. Assumpton of gven weghts and value functons: due to the hgh number of attrbutes, the user cannot be quered about each value functon and each attrbute weght. In addton, there s usually agreement on value functons and weghts. So, they are assumed as fxed. Complexty of aggregaton functon: the use of a smple aggregaton functon (whch uses the above descrbed weghted addton) posed no problems. So, there was no need to use a more complex aggregaton functon. 7 CAWICOMS s the acronym of Customer-Adaptve Web Interface for the Confguraton of Products and Servces wth Multple Supplers

7 5 Concluson and Future Work We have examned some approaches for modelng the user's nterests and therefore the user's evaluaton functon. It was shown that all these approaches are compatble wth MAUT and dffer n ther complexty. Some rules have been proposed ndcatng when to use whch complexty. In ths paper, only some work regardng the work of estmatng the user s nterests has been taken nto account. It would be nterestng to extend ths survey ncludng all relevant user modelng approaches for estmatng the user s nterests. 6 References [CC00] CAWICOMS Consortum (2000). Delverable D01 Requrements, Applcaton Scenaros, Overall archtecture, and Test Specfcaton. [CP01] Chn, D., and Porage, A. (2001). Acqurng User Preferences for Product Customzaton. In Proceedngs of the 8 th Internatonal Conference, UM [CP01] Chn, D., and Porage, A. (2001). Acqurng User Preferences for Product Customzaton. In Proceedngs of the 8 th Internatonal Conference, UM [EMM+01] Elert, S., Mentrup, A., Mueller, M. E., Rolf, R., Rollnger, C.-R., Severtsen F., and Trenkamp, F. (2001). Bkn - user adaptve news classfcaton n the world web web. In Schäfer, R., Müller, M. E., and Macskassy, S. A., edtors, Proceedngs of the UM2001 Workshop on Machne Learnng for User Modelng, pages [Koy01] Koychev, I. (2001). Learnng about user n the presence of hdden context. In Schäfer, R., Müller, M. E., and Macskassy, S. A., edtors, Proceedngs of the UM2001 Workshop on Machne Learnng for User Modelng, pages [LHL97] Lnden, G., Hanks, S., and Lesh, N. (1997). Interactve Assessment of User Preference Models: The Automated Travel Asssstant. In Proceedngs of the 6 th Internatonal Conference, UM97 [St00] Stftung Warentest (2000). Dgtalkameras: Pxeljagd. In: test 6/2000. Avalable va [SM01] Schütz, W. and Meyer, M. (2001). Defnton ener Parameter-Herarche zur Adapterung der Benutzer-Interakton n E-Commerce-Systemen. In Proceedngs of ABIS [WE86] Wnterfeld, D. von and Edwards, W. (1986). Decson Analyss and Behavoral Research. Cambrdge, England: Cambrdge UnverstyPress.

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

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

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

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 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 A mathematcal programmng approach to the analyss, desgn and

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

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

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

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

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

DLK Pro the all-rounder for mobile data downloading. Tailor-made for various requirements.

DLK Pro the all-rounder for mobile data downloading. Tailor-made for various requirements. DLK Pro the all-rounder for moble data downloadng Talor-made for varous requrements www.dtco.vdo.com Smply brllant, brllantly smple Always the rght soluton The DLK Pro s the VDO product famly, whch sets

More information

PRÉSENTATIONS DE PROJETS

PRÉSENTATIONS DE PROJETS PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng

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

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

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

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

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

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Brave New World Pseudocode Reference

Brave New World Pseudocode Reference Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be

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

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

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

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

EXTENDED BIC CRITERION FOR MODEL SELECTION

EXTENDED BIC CRITERION FOR MODEL SELECTION IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7

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

GSLM Operations Research II Fall 13/14

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

More information

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

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

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

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

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

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

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

Modeling Local Uncertainty accounting for Uncertainty in the Data

Modeling Local Uncertainty accounting for Uncertainty in the Data Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

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

Related-Mode Attacks on CTR Encryption Mode

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

More information

A 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

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

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

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

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

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

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

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

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

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

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

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

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

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal

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

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

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

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

More information

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

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

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

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

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

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND

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

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

Distributed Resource Scheduling in Grid Computing Using Fuzzy Approach

Distributed Resource Scheduling in Grid Computing Using Fuzzy Approach Dstrbuted Resource Schedulng n Grd Computng Usng Fuzzy Approach Shahram Amn, Mohammad Ahmad Computer Engneerng Department Islamc Azad Unversty branch Mahallat, Iran Islamc Azad Unversty branch khomen,

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

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

More information

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

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

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

CSCI 5417 Information Retrieval Systems Jim Martin!

CSCI 5417 Information Retrieval Systems Jim Martin! CSCI 5417 Informaton Retreval Systems Jm Martn! Lecture 11 9/29/2011 Today 9/29 Classfcaton Naïve Bayes classfcaton Ungram LM 1 Where we are... Bascs of ad hoc retreval Indexng Term weghtng/scorng Cosne

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

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

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

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

Fusion Performance Model for Distributed Tracking and Classification

Fusion Performance Model for Distributed Tracking and Classification Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.

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

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

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

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

CHAPTER 3 AHP, FUZZY AHP AND GRA

CHAPTER 3 AHP, FUZZY AHP AND GRA 38 CHAPTER 3 AHP, FUZZY AHP AND GRA 3.1 INTRODUCTION The purpose of ths chapter s to dscuss the fundamental concepts of AHP, Fuzzy AHP and GRA. The steps nvolved n AHP, characterstcs and lmtatons of AHP

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems: Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:

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

Feature Reduction and Selection

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

More information

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

Supervised Learning in Parallel Universes Using Neighborgrams

Supervised Learning in Parallel Universes Using Neighborgrams Supervsed Learnng n Parallel Unverses Usng Neghborgrams Bernd Wswedel and Mchael R. Berthold Department of Computer and Informaton Scence, Unversty of Konstanz, Germany Abstract. We present a supervsed

More information

CS 534: Computer Vision Model Fitting

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

More information

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

Assembler. Building a Modern Computer From First Principles.

Assembler. Building a Modern Computer From First Principles. Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought

More information

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF Johannes Leebmann Insttute of Photogrammetry and Remote Sensng, Unversty of Karlsruhe (TH, Englerstrasse 7, 7618 Karlsruhe, Germany - leebmann@pf.un-karlsruhe.de

More information

Lecture 13: High-dimensional Images

Lecture 13: High-dimensional Images Lec : Hgh-dmensonal Images Grayscale Images Lecture : Hgh-dmensonal Images Math 90 Prof. Todd Wttman The Ctadel A grayscale mage s an nteger-valued D matrx. An 8-bt mage takes on values between 0 and 55.

More information

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

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

More information

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

Optimal Workload-based Weighted Wavelet Synopses

Optimal Workload-based Weighted Wavelet Synopses Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,

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

Specifications in 2001

Specifications in 2001 Specfcatons n 200 MISTY (updated : May 3, 2002) September 27, 200 Mtsubsh Electrc Corporaton Block Cpher Algorthm MISTY Ths document shows a complete descrpton of encrypton algorthm MISTY, whch are secret-key

More information

Model Integrated Computing: A Framework for Creating Domain Specific Design Environments

Model Integrated Computing: A Framework for Creating Domain Specific Design Environments Model Integrated Computng: A Framework for Creatng Doman Specfc Desgn Envronments James R. DAVIS Vanderblt Unversty, Insttute for Software Integrated Systems Nashvlle, TN 37203, USA ABSTRACT Model Integrated

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

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

Determining Fuzzy Sets for Quantitative Attributes in Data Mining Problems

Determining Fuzzy Sets for Quantitative Attributes in Data Mining Problems Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku

More information

MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS

MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS Int. Journal for Housng Scence, Vol.38, No.1 pp.13-23, 2014 Publshed n the Unted States MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS Ádám BUKOVICS Szécheny István Unversty Department of Structural

More information