Machine Learning. Spectral Clustering. Lecture 23, April 14, Reading: Eric Xing 1
|
|
- Kristian McGee
- 5 years ago
- Views:
Transcription
1 Machne Leanng -7/5 7/5-78, 78, Spng 8 Spectal Clusteng Ec Xng Lectue 3, pl 4, 8 Readng: Ec Xng Data Clusteng wo dffeent ctea Compactness, e.g., k-means, mxtue models Connectvty, e.g., spectal clusteng Compactness Connectvty Ec Xng
2 Ec Xng 3 Spectal Clusteng Data Smlates Ec Xng 4
3 Weghted Gaph Pattonng Some gaph temnology Objects (e.g., pxels, data ponts) W j j I = vetces of gaph G Edges (j) = pxel pas wth W j > Smlaty matx W = [ W j ] Degee d = Σ j G W j d = Σ d degee of G B ssoc(, = Σ Σ j B W j Ec Xng 5 Cuts n a Gaph (edge) cut = set of edges whose emoval makes a gaph dsconnected weght of a cut: cut(, B ) = Σ Σ j B W j =ssoc(, Nomalzed Cut ctea: mnmum cut(,ā) cut(, ) cut(, ) Ncut(, ) = + d d Moe geneally: k Ncut(, K k ) = =, j V \, j V W j = W j = cut(, ) d Ec Xng 6 k 3
4 Gaph-based Clusteng Data Goupng W j j W j W = f d( x, x )) j ( j G = {V,E} Image sgmentaton ffnty matx: Degee matx: Laplacan matx: W = [ w, j ] D = dag( d ) L = D W (bpatte) patton vecto: x = [ x,...,x = [,,K,,, K ] Ec Xng 7 N ] ffnty Functon W = e, j X X j σ ffntes gow as σ gows How the choce of σ value affects the esults? What would be the optmal choce fo σ? Ec Xng 8 4
5 Clusteng va Optmzng Nomalzed Cut he nomalzed cut: cut(, cut(, Ncut(, = + d d B Computng an optmal nomalzed cut ove all possble y (.e., patton) s NP had ansfom Ncut equaton to a matx fom (Sh & Malk ): mn x y ( D W) y Ncut( x) = mny y Dy n y {, b} y D = Subject to: Raylegh quotent cut(, cut(, Stll an NP had poblem Ncut(, = + deg() deg( ( + x) ( D S)( + x) ( x) ( D S)( x) > D(, ) x = + ; k = k D ( k) D D(, ) Ec Xng =... 9 Relaxaton mn Ncut( x) = mn x Subject to: y y {, b} y D = y ( D W) y y Dy n Raylegh quotent Instead, elax nto the contnuous doman by solvng genealzed egenvalue system: mn y ( D W) y, s.t. y Dy = y Whch gves: ( D W ) y = λdy Raylegh quotent theoem ( D W ) = Note that so, the fst egenvecto s y = wth egenvalue. he second smallest egenvecto s the eal valued soluton to ths poblem!! Ec Xng 5
6 lgothm. Defne a smlaty functon between nodes..e.: w = e, j X ( ) X ( j ) σ X. Compute affnty matx (W) and degee matx (D). 3. Solve ( D W ) y = λdy Do sngula value decomposton (SVD) of the gaph Laplacan L V * = ΛV y L = D W 4. Use the egenvecto wth the second smallest egenvalue,, to bpatton the gaph. Fo each theshold k, k ={ y among k lagest element of y*} B k ={ y among n-k smallest element of y*} Compute Ncut( k,b k ) * Output k = ag max Ncut( k, B k ) and k *, B * Ec Xng k y * Ideally y ( D S) y Ncut(, =, wth y {, b}, y D =. y Dy y ( D S) y = λdy y Ec Xng 6
7 Example (Xng et al, ) Ec Xng 3 Poo featues can lead to poo outcome (Xng et al ) Ec Xng 4 7
8 Cluste vs. Block matx cut(, cut(, Ncut(, = + d Degee( ) = d B W, j V, j B cut(, cut(, Ncut(, = + d d B B Ec Xng 5 Compae to Mnmum cut Cteon fo patton: mn cut(, = mn Poblem! Weght Weght of of cut cut s s dectly dectly popotonal popotonal to to the the numbe numbe of of edges edges n n the the cut. cut., B W, j B, j B Ideal Cut Cuts wth lesse weght than the deal cut Fst poposed by Wu and Leahy Ec Xng 6 8
9 Supeo Pefomance? K-means and Gaussan mxtue methods ae based towad convex clustes Ec Xng 7 Ncut s supeo n cetan cases Ec Xng 8 9
10 Why? Ec Xng 9 Geneal Spectal Clusteng Data Smlates Ec Xng
11 Repesentaton Patton matx X: [ X ] X =,..., X K segments pxels Pa-wse smlaty matx W: W (, j) = aff (, j) Degee matx D: Laplacan matx L: D w j, j (, ) = L = D W Ec Xng Egenvectos and blocks Block matces have block egenvectos: λ = λ = λ 3 =.7 λ 4 = egensolve Nea-block matces have nea-block egenvectos: λ =. λ =. λ 3 = λ 4 = egensolve Ec Xng
12 Spectal Space Can put tems nto blocks by egenvectos: e e -..7 e e Clustes clea egadless of ow odeng: e e -..7 e e Ec Xng 3 Spectal Clusteng lgothms that cluste ponts usng egenvectos of matces deved fom the data Obtan data epesentaton n the low-dmensonal space that can be easly clusteed Vaety of methods that use the egenvectos dffeently (we have seen an example) Empcally vey successful uthos dsagee: Whch egenvectos to use How to deve clustes fom these egenvectos wo geneal methods Ec Xng 4
13 Method # Patton usng only one egenvecto at a tme Use pocedue ecusvely Example: Image Segmentaton Uses nd (smallest) egenvecto to defne optmal cut Recusvely geneates two clustes wth each cut Ec Xng 5 Method # Use k egenvectos (k chosen by use) Dectly compute k-way pattonng Expementally has been seen to be bette Ec Xng 6 3
14 Spectal Clusteng lgothm Ng, Jodan, and Wess 3 Gven a set of ponts S={s, s n } Fom the affnty matx w, j = e S S j σ, j, w, = Defne dagonal matx D = Σ κ a k Fom the matx L = D WD / / Stack the k lagest egenvectos of L to fo the columns of the new matx X: X = x x Renomalze each of X s ows to have unt length and get new matx Y. Cluste ows of Y as ponts n R k Ec Xng 7 L x k SC vs Kmeans Ec Xng 8 4
15 5 Ec Xng 9 Why t woks? K-means n the spectum space! Ec Xng 3 Moe fomally Recall genealzed Ncut Mnmzng ths s equvalent to spectal clusteng = = = = k k V j j V j j k d W W ), cut( ), Ncut(, \, K = = k k d ), cut( ), Ncut( mn K Y WD D Y / / mn I Y Y = s.t. segments pxels Y
16 oy examples Images fom Matthew Band (R--4) Ec Xng 3 Use s Peogatve Choce of k, the numbe of clustes Choce of scalng facto σ Realstcally, seach ove and pck value that gves the tghtest clustes Choce of clusteng method: k-way o ecusve bpatte Kenel affnty matx w = K( S, S, j j ) Ec Xng 3 6
17 Conclusons Good news: Smple and poweful methods to segment mages. Flexble and easy to apply to othe clusteng poblems. Bad news: Hgh memoy equements (use spase matces). Vey dependant on the scale facto fo a specfc poblem. W X ( ) X ( j ) σ X (, j) = e Ec Xng 33 7
Correspondence Analysis & Related Methods
Coespondence Analyss & Related Methods Ineta contbutons n weghted PCA PCA s a method of data vsualzaton whch epesents the tue postons of ponts n a map whch comes closest to all the ponts, closest n sense
More informationSet of square-integrable function 2 L : function space F
Set of squae-ntegable functon L : functon space F Motvaton: In ou pevous dscussons we have seen that fo fee patcles wave equatons (Helmholt o Schödnge) can be expessed n tems of egenvalue equatons. H E,
More informationKhintchine-Type Inequalities and Their Applications in Optimization
Khntchne-Type Inequaltes and The Applcatons n Optmzaton Anthony Man-Cho So Depatment of Systems Engneeng & Engneeng Management The Chnese Unvesty of Hong Kong ISDS-Kolloquum Unvestaet Wen 29 June 2009
More informationMachine Learning 4771
Machne Leanng 4771 Instucto: Tony Jebaa Topc 6 Revew: Suppot Vecto Machnes Pmal & Dual Soluton Non-sepaable SVMs Kenels SVM Demo Revew: SVM Suppot vecto machnes ae (n the smplest case) lnea classfes that
More informationLearning the structure of Bayesian belief networks
Lectue 17 Leanng the stuctue of Bayesan belef netwoks Mlos Hauskecht mlos@cs.ptt.edu 5329 Sennott Squae Leanng of BBN Leanng. Leanng of paametes of condtonal pobabltes Leanng of the netwok stuctue Vaables:
More informationMultistage Median Ranked Set Sampling for Estimating the Population Median
Jounal of Mathematcs and Statstcs 3 (: 58-64 007 ISSN 549-3644 007 Scence Publcatons Multstage Medan Ranked Set Samplng fo Estmatng the Populaton Medan Abdul Azz Jeman Ame Al-Oma and Kamaulzaman Ibahm
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationThermodynamics of solids 4. Statistical thermodynamics and the 3 rd law. Kwangheon Park Kyung Hee University Department of Nuclear Engineering
Themodynamcs of solds 4. Statstcal themodynamcs and the 3 d law Kwangheon Pak Kyung Hee Unvesty Depatment of Nuclea Engneeng 4.1. Intoducton to statstcal themodynamcs Classcal themodynamcs Statstcal themodynamcs
More information8 Baire Category Theorem and Uniform Boundedness
8 Bae Categoy Theoem and Unfom Boundedness Pncple 8.1 Bae s Categoy Theoem Valdty of many esults n analyss depends on the completeness popety. Ths popety addesses the nadequacy of the system of atonal
More informationClustering. Outline. Supervised vs. Unsupervised Learning. Clustering. Clustering Example. Applications of Clustering
Clusteng CS478 Mahne Leanng Spng 008 Thosten Joahms Conell Unvesty Outlne Supevsed vs. Unsupevsed Leanng Heahal Clusteng Heahal Agglomeatve Clusteng (HAC) Non-Heahal Clusteng K-means EM-Algothm Readng:
More information4 Recursive Linear Predictor
4 Recusve Lnea Pedcto The man objectve of ths chapte s to desgn a lnea pedcto wthout havng a po knowledge about the coelaton popetes of the nput sgnal. In the conventonal lnea pedcto the known coelaton
More information4 SingularValue Decomposition (SVD)
/6/00 Z:\ jeh\self\boo Kannan\Jan-5-00\4 SVD 4 SngulaValue Decomposton (SVD) Chapte 4 Pat SVD he sngula value decomposton of a matx s the factozaton of nto the poduct of thee matces = UDV whee the columns
More informationChapter Fifiteen. Surfaces Revisited
Chapte Ffteen ufaces Revsted 15.1 Vecto Descpton of ufaces We look now at the vey specal case of functons : D R 3, whee D R s a nce subset of the plane. We suppose s a nce functon. As the pont ( s, t)
More informationPhysics 11b Lecture #2. Electric Field Electric Flux Gauss s Law
Physcs 11b Lectue # Electc Feld Electc Flux Gauss s Law What We Dd Last Tme Electc chage = How object esponds to electc foce Comes n postve and negatve flavos Conseved Electc foce Coulomb s Law F Same
More informationV. Principles of Irreversible Thermodynamics. s = S - S 0 (7.3) s = = - g i, k. "Flux": = da i. "Force": = -Â g a ik k = X i. Â J i X i (7.
Themodynamcs and Knetcs of Solds 71 V. Pncples of Ievesble Themodynamcs 5. Onsage s Teatment s = S - S 0 = s( a 1, a 2,...) a n = A g - A n (7.6) Equlbum themodynamcs detemnes the paametes of an equlbum
More informationClassification. Representing data: Hypothesis (classifier) Lecture 2, September 14, Reading: Eric CMU,
Machne Learnng 10-701/15-781, 781, Fall 2011 Nonparametrc methods Erc Xng Lecture 2, September 14, 2011 Readng: 1 Classfcaton Representng data: Hypothess (classfer) 2 1 Clusterng 3 Supervsed vs. Unsupervsed
More informationP 365. r r r )...(1 365
SCIENCE WORLD JOURNAL VOL (NO4) 008 www.scecncewoldounal.og ISSN 597-64 SHORT COMMUNICATION ANALYSING THE APPROXIMATION MODEL TO BIRTHDAY PROBLEM *CHOJI, D.N. & DEME, A.C. Depatment of Mathematcs Unvesty
More informationBackground. 3D Object recognition. Modeling polyhedral objects. Modeling polyhedral objects. Object and world coordinate systems
3D Object ecognton Backgound Backgound n-pont pespectve algothms Geometc hashng Vew-based ecognton Recognton as pose estmaton Object pose defnes t embeddng n thee dmensonal space 3 degees of postonal feedom
More informationGeneral Variance Covariance Structures in Two-Way Random Effects Models
Appled Mathematcs 3 4 64-63 http://dxdoog/436/am34486 Publshed Onlne Apl 3 (http://wwwscpog/jounal/am) Geneal aance Covaance Stuctues n wo-way Rom Effects Models Calos e Poes Jaya Kshnakuma epatment of
More informationPHYS 705: Classical Mechanics. Derivation of Lagrange Equations from D Alembert s Principle
1 PHYS 705: Classcal Mechancs Devaton of Lagange Equatons fom D Alembet s Pncple 2 D Alembet s Pncple Followng a smla agument fo the vtual dsplacement to be consstent wth constants,.e, (no vtual wok fo
More informationA. Thicknesses and Densities
10 Lab0 The Eath s Shells A. Thcknesses and Denstes Any theoy of the nteo of the Eath must be consstent wth the fact that ts aggegate densty s 5.5 g/cm (ecall we calculated ths densty last tme). In othe
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More informationA Novel Approach to Expression Recognition from Non-frontal Face Images
A Novel Appoach to Expesson Recognton fom Non-fontal Face Images Wenmng Zheng 1,2, HaoTang 1, Zhouchen Ln 3, Thomas S. Huang 1 1 Beckman Insttute, Unvesty of Illnos at Ubana-Champagn, USA 2 Reseach Cente
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationDISC-GLASSO: DISCRIMINATIVE GRAPH LEARNING WITH SPARSITY REGULARIZATION. 201 Broadway, Cambridge, MA 02139, USA
DISC-GLASSO: DISCRIMINATIVE GRAPH LEARNING WITH SPARSITY REGULARIZATION Jun-Yu Kao,2 Dong Tan Hassan Mansou Antono Otega 2 Anthony Veto Mtsubsh Electc Reseach Labs (MERL), 20 Boadway, Cambdge, MA 0239,
More informationDensity Functional Theory I
Densty Functonal Theoy I cholas M. Hason Depatment of Chemsty Impeal College Lonon & Computatonal Mateals Scence Daesbuy Laboatoy ncholas.hason@c.ac.uk Densty Functonal Theoy I The Many Electon Schönge
More informationUsing DP for hierarchical discretization of continuous attributes. Amit Goyal (31 st March 2008)
Usng DP fo heachcal dscetzaton of contnos attbtes Amt Goyal 31 st Mach 2008 Refeence Chng-Cheng Shen and Yen-Lang Chen. A dynamc-pogammng algothm fo heachcal dscetzaton of contnos attbtes. In Eopean Jonal
More informationSpectral Clustering. Shannon Quinn
Spectral Clusterng Shannon Qunn (wth thanks to Wllam Cohen of Carnege Mellon Unverst, and J. Leskovec, A. Raaraman, and J. Ullman of Stanford Unverst) Graph Parttonng Undrected graph B- parttonng task:
More informationPHY126 Summer Session I, 2008
PHY6 Summe Sesson I, 8 Most of nfomaton s avalable at: http://nngoup.phscs.sunsb.edu/~chak/phy6-8 ncludng the sllabus and lectue sldes. Read sllabus and watch fo mpotant announcements. Homewok assgnment
More informationPattern Analyses (EOF Analysis) Introduction Definition of EOFs Estimation of EOFs Inference Rotated EOFs
Patten Analyses (EOF Analyss) Intoducton Defnton of EOFs Estmaton of EOFs Infeence Rotated EOFs . Patten Analyses Intoducton: What s t about? Patten analyses ae technques used to dentfy pattens of the
More informationDetection and Estimation Theory
ESE 54 Detecton and Etmaton Theoy Joeph A. O Sullvan Samuel C. Sach Pofeo Electonc Sytem and Sgnal Reeach Laboatoy Electcal and Sytem Engneeng Wahngton Unvety 411 Jolley Hall 314-935-4173 (Lnda anwe) jao@wutl.edu
More informationEnergy in Closed Systems
Enegy n Closed Systems Anamta Palt palt.anamta@gmal.com Abstact The wtng ndcates a beakdown of the classcal laws. We consde consevaton of enegy wth a many body system n elaton to the nvese squae law and
More informationVibration Input Identification using Dynamic Strain Measurement
Vbaton Input Identfcaton usng Dynamc Stan Measuement Takum ITOFUJI 1 ;TakuyaYOSHIMURA ; 1, Tokyo Metopoltan Unvesty, Japan ABSTRACT Tansfe Path Analyss (TPA) has been conducted n ode to mpove the nose
More informationGenerating Functions, Weighted and Non-Weighted Sums for Powers of Second-Order Recurrence Sequences
Geneatng Functons, Weghted and Non-Weghted Sums fo Powes of Second-Ode Recuence Sequences Pantelmon Stăncă Aubun Unvesty Montgomey, Depatment of Mathematcs Montgomey, AL 3614-403, USA e-mal: stanca@studel.aum.edu
More informationIf there are k binding constraints at x then re-label these constraints so that they are the first k constraints.
Mathematcal Foundatons -1- Constaned Optmzaton Constaned Optmzaton Ma{ f ( ) X} whee X {, h ( ), 1,, m} Necessay condtons fo to be a soluton to ths mamzaton poblem Mathematcally, f ag Ma{ f ( ) X}, then
More informationDirichlet Mixture Priors: Inference and Adjustment
Dchlet Mxtue Pos: Infeence and Adustment Xugang Ye (Wokng wth Stephen Altschul and Y Kuo Yu) Natonal Cante fo Botechnology Infomaton Motvaton Real-wold obects Independent obsevatons Categocal data () (2)
More informationResearch Article Incremental Tensor Principal Component Analysis for Handwritten Digit Recognition
Hndaw Publshng Copoaton athematcal Poblems n Engneeng, Atcle ID 89758, 0 pages http://dx.do.og/0.55/04/89758 Reseach Atcle Incemental enso Pncpal Component Analyss fo Handwtten Dgt Recognton Chang Lu,,
More information6.6 The Marquardt Algorithm
6.6 The Mqudt Algothm lmttons of the gdent nd Tylo expnson methods ecstng the Tylo expnson n tems of ch-sque devtves ecstng the gdent sech nto n tetve mtx fomlsm Mqudt's lgothm utomtclly combnes the gdent
More informationρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to
THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,
More information19 The Born-Oppenheimer Approximation
9 The Bon-Oppenheme Appoxmaton The full nonelatvstc Hamltonan fo a molecule s gven by (n a.u.) Ĥ = A M A A A, Z A + A + >j j (883) Lets ewte the Hamltonan to emphasze the goal as Ĥ = + A A A, >j j M A
More informationCS 468 Lecture 16: Isometry Invariance and Spectral Techniques
CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that
More informationChapter I Matrices, Vectors, & Vector Calculus 1-1, 1-9, 1-10, 1-11, 1-17, 1-18, 1-25, 1-27, 1-36, 1-37, 1-41.
Chapte I Matces, Vectos, & Vecto Calculus -, -9, -0, -, -7, -8, -5, -7, -36, -37, -4. . Concept of a Scala Consde the aa of patcles shown n the fgue. he mass of the patcle at (,) can be epessed as. M (,
More informationIntegral Vector Operations and Related Theorems Applications in Mechanics and E&M
Dola Bagayoko (0) Integal Vecto Opeatons and elated Theoems Applcatons n Mechancs and E&M Ι Basc Defnton Please efe to you calculus evewed below. Ι, ΙΙ, andιιι notes and textbooks fo detals on the concepts
More information3. A Review of Some Existing AW (BT, CT) Algorithms
3. A Revew of Some Exstng AW (BT, CT) Algothms In ths secton, some typcal ant-wndp algothms wll be descbed. As the soltons fo bmpless and condtoned tansfe ae smla to those fo ant-wndp, the pesented algothms
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationImpact of Polarimetric Dimensionality of Forest Parameter Estimation by Means of Polarimetric SAR interferometry
Impact of Polametc Dmensonalty of Foest Paamete Estmaton by Means of Polametc SAR ntefeomety Jun Su Km, Seung-Kuk Lee, Konstantnos Papathanassou, and Iena Hajnsek Geman Aeospace Cente Mcowaves and Rada
More informationCS649 Sensor Networks IP Track Lecture 3: Target/Source Localization in Sensor Networks
C649 enso etwoks IP Tack Lectue 3: Taget/ouce Localaton n enso etwoks I-Jeng Wang http://hng.cs.jhu.edu/wsn06/ png 006 C 649 Taget/ouce Localaton n Weless enso etwoks Basc Poblem tatement: Collaboatve
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationPart V: Velocity and Acceleration Analysis of Mechanisms
Pat V: Velocty an Acceleaton Analyss of Mechansms Ths secton wll evew the most common an cuently pactce methos fo completng the knematcs analyss of mechansms; escbng moton though velocty an acceleaton.
More informationAnnouncements. Stereo (Part 3) Summary of Stereo Constraints. Features on same epipolar line. Stereo matching. Truco Fig. 7.5
Announcements Steeo (Pat ) Homewok s due Nov, :59 PM Readng: Chapte 7: Steeopss CSE 5A Lectue 0 Featues on same eppola lne Summay of Steeo Constants CONSRAIN BRIEF DESCRIPION -D Eppola Seach Abtay mages
More informationScalars and Vectors Scalar
Scalas and ectos Scala A phscal quantt that s completel chaacteed b a eal numbe (o b ts numecal value) s called a scala. In othe wods a scala possesses onl a magntude. Mass denst volume tempeatue tme eneg
More informationPhysics Exam II Chapters 25-29
Physcs 114 1 Exam II Chaptes 5-9 Answe 8 of the followng 9 questons o poblems. Each one s weghted equally. Clealy mak on you blue book whch numbe you do not want gaded. If you ae not sue whch one you do
More informationError Bars in both X and Y
Error Bars n both X and Y Wrong ways to ft a lne : 1. y(x) a x +b (σ x 0). x(y) c y + d (σ y 0) 3. splt dfference between 1 and. Example: Prmordal He abundance: Extrapolate ft lne to [ O / H ] 0. [ He
More informationPhysics 2A Chapter 11 - Universal Gravitation Fall 2017
Physcs A Chapte - Unvesal Gavtaton Fall 07 hese notes ae ve pages. A quck summay: he text boxes n the notes contan the esults that wll compse the toolbox o Chapte. hee ae thee sectons: the law o gavtaton,
More informationInformation Retrieval
Clusteng Technques fo Infomaton Reteval Beln Chen Depatment t of Compute Scence & Infomaton Engneeng Natonal Tawan Nomal Unvesty Refeences:. Chstophe D. Mannng, Pabhaa Raghavan and Hnch Schütze, Intoducton
More informationStanford University CS259Q: Quantum Computing Handout 8 Luca Trevisan October 18, 2012
Stanfod Univesity CS59Q: Quantum Computing Handout 8 Luca Tevisan Octobe 8, 0 Lectue 8 In which we use the quantum Fouie tansfom to solve the peiod-finding poblem. The Peiod Finding Poblem Let f : {0,...,
More informationEfficiency of the principal component Liu-type estimator in logistic
Effcency of the pncpal component Lu-type estmato n logstc egesson model Jbo Wu and Yasn Asa 2 School of Mathematcs and Fnance, Chongqng Unvesty of Ats and Scences, Chongqng, Chna 2 Depatment of Mathematcs-Compute
More informationAsymptotic Waves for a Non Linear System
Int Jounal of Math Analyss, Vol 3, 9, no 8, 359-367 Asymptotc Waves fo a Non Lnea System Hamlaou Abdelhamd Dépatement de Mathématques, Faculté des Scences Unvesté Bad Mokhta BP,Annaba, Algea hamdhamlaou@yahoof
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationInformation Retrieval Advanced IR models. Luca Bondi
Advanced IR models Luca Bondi Advanced IR models 2 (LSI) Pobabilistic Latent Semantic Analysis (plsa) Vecto Space Model 3 Stating point: Vecto Space Model Documents and queies epesented as vectos in the
More informationContact, information, consultations
ontact, nfomaton, consultatons hemsty A Bldg; oom 07 phone: 058-347-769 cellula: 664 66 97 E-mal: wojtek_c@pg.gda.pl Offce hous: Fday, 9-0 a.m. A quote of the week (o camel of the week): hee s no expedence
More informationCOORDINATE SYSTEMS, COORDINATE TRANSFORMS, AND APPLICATIONS
Dola Bagaoo 0 COORDINTE SYSTEMS COORDINTE TRNSFORMS ND PPLICTIONS I. INTRODUCTION Smmet coce of coodnate sstem. In solvng Pscs poblems one cooses a coodnate sstem tat fts te poblem at and.e. a coodnate
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationRigid Bodies: Equivalent Systems of Forces
Engneeng Statcs, ENGR 2301 Chapte 3 Rgd Bodes: Equvalent Sstems of oces Intoducton Teatment of a bod as a sngle patcle s not alwas possble. In geneal, the se of the bod and the specfc ponts of applcaton
More informationExperimental study on parameter choices in norm-r support vector regression machines with noisy input
Soft Comput 006) 0: 9 3 DOI 0.007/s00500-005-0474-z ORIGINAL PAPER S. Wang J. Zhu F. L. Chung Hu Dewen Expemental study on paamete choces n nom- suppot vecto egesson machnes wth nosy nput Publshed onlne:
More informationRobust Feature Induction for Support Vector Machines
Robust Featue Inducton fo Suppot Vecto Machnes Rong Jn Depatment of Compute Scence and Engneeng, Mchgan State Unvesty, East Lansng, MI4884 ROGJI@CSE.MSU.EDU Huan Lu Depatment of Compute Scence and Engneeng,
More informationEE 5337 Computational Electromagnetics (CEM)
7//28 Instucto D. Raymond Rumpf (95) 747 6958 cumpf@utep.edu EE 5337 Computatonal Electomagnetcs (CEM) Lectue #6 TMM Extas Lectue 6These notes may contan copyghted mateal obtaned unde fa use ules. Dstbuton
More informationConstraint Score: A New Filter Method for Feature Selection with Pairwise Constraints
onstant Scoe: A New Flte ethod fo Featue Selecton wth Pawse onstants Daoqang Zhang, Songcan hen and Zh-Hua Zhou Depatment of ompute Scence and Engneeng Nanjng Unvesty of Aeonautcs and Astonautcs, Nanjng
More informationTian Zheng Department of Statistics Columbia University
Haplotype Tansmsson Assocaton (HTA) An "Impotance" Measue fo Selectng Genetc Makes Tan Zheng Depatment of Statstcs Columba Unvesty Ths s a jont wok wth Pofesso Shaw-Hwa Lo n the Depatment of Statstcs at
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More informationBackward Haplotype Transmission Association (BHTA) Algorithm. Tian Zheng Department of Statistics Columbia University. February 5 th, 2002
Backwad Haplotype Tansmsson Assocaton (BHTA) Algothm A Fast ult-pont Sceenng ethod fo Complex Tats Tan Zheng Depatment of Statstcs Columba Unvesty Febuay 5 th, 2002 Ths s a jont wok wth Pofesso Shaw-Hwa
More informationPotential Fields in Cooperative Motion Control and Formations
Pepaed by F.L. Lews and E. Stngu Updated: Satuday, Febuay 0, 03 Potental Felds n Coopeatve Moton Contol and Fomatons Add dscusson. Refe to efs.. Potental Felds Equaton Chapte Secton The potental s a scala
More informationNorms, Condition Numbers, Eigenvalues and Eigenvectors
Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationEvent Shape Update. T. Doyle S. Hanlon I. Skillicorn. A. Everett A. Savin. Event Shapes, A. Everett, U. Wisconsin ZEUS Meeting, October 15,
Event Shape Update A. Eveett A. Savn T. Doyle S. Hanlon I. Skllcon Event Shapes, A. Eveett, U. Wsconsn ZEUS Meetng, Octobe 15, 2003-1 Outlne Pogess of Event Shapes n DIS Smla to publshed pape: Powe Coecton
More informationOptimization Methods: Linear Programming- Revised Simplex Method. Module 3 Lecture Notes 5. Revised Simplex Method, Duality and Sensitivity analysis
Optmzaton Meods: Lnea Pogammng- Revsed Smple Meod Module Lectue Notes Revsed Smple Meod, Dualty and Senstvty analyss Intoducton In e pevous class, e smple meod was dscussed whee e smple tableau at each
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationVParC: A Compression Scheme for Numeric Data in Column-Oriented Databases
The Intenatonal Aab Jounal of Infomaton Technology VPaC: A Compesson Scheme fo Numec Data n Column-Oented Databases Ke Yan, Hong Zhu, and Kevn Lü School of Compute Scence and Technology, Huazhong Unvesty
More informationMultipole Radiation. March 17, 2014
Multpole Radaton Mach 7, 04 Zones We wll see that the poblem of hamonc adaton dvdes nto thee appoxmate egons, dependng on the elatve magntudes of the dstance of the obsevaton pont,, and the wavelength,
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationTutorial Chemical Reaction Engineering:
Dpl.-Ing. ndeas Jöke Tutoal Chemal eaton Engneeng:. eal eatos, esdene tme dstbuton and seletvty / yeld fo eaton netwoks Insttute of Poess Engneeng, G5-7, andeas.joeke@ovgu.de 8-Jun-6 Tutoal CE: esdene
More informationAnouncements. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers. Multigrid Solvers
Anouncements ultgrd Solvers The readng semnar starts ths week: o Usuall t wll e held n NEB 37 o Ths week t wll e n arland 3 chael Kazhdan (6657 ultgrd Solvers Recall: To compute the soluton to the osson
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationCS4495/6495 Introduction to Computer Vision. 3C-L3 Calibrating cameras
CS4495/6495 Introducton to Computer Vson 3C-L3 Calbratng cameras Fnally (last tme): Camera parameters Projecton equaton the cumulatve effect of all parameters: M (3x4) f s x ' 1 0 0 0 c R 0 I T 3 3 3 x1
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationEffective Discriminative Feature Selection with Non-trivial Solutions
Effectve Dscmnatve Featue Selecton wth Non-tval Solutons Hong Tao, Chenpng Hou, Membe, IEEE, Fepng Ne, Yuanyuan Jao, Dongyun Y axv:4.548v [cs.lg] Ap 5 Abstact Featue selecton and featue tansfomaton, the
More information( m is the length of columns of A ) spanned by the columns of A : . Select those columns of B that contain a pivot; say those are Bi
Assgmet /MATH 47/Wte Due: Thusday Jauay The poblems to solve ae umbeed [] to [] below Fst some explaatoy otes Fdg a bass of the colum-space of a max ad povg that the colum ak (dmeso of the colum space)
More informationExact Simplification of Support Vector Solutions
Jounal of Machne Leanng Reseach 2 (200) 293-297 Submtted 3/0; Publshed 2/0 Exact Smplfcaton of Suppot Vecto Solutons Tom Downs TD@ITEE.UQ.EDU.AU School of Infomaton Technology and Electcal Engneeng Unvesty
More informationAn Approach to Inverse Fuzzy Arithmetic
An Appoach to Invese Fuzzy Athmetc Mchael Hanss Insttute A of Mechancs, Unvesty of Stuttgat Stuttgat, Gemany mhanss@mechaun-stuttgatde Abstact A novel appoach of nvese fuzzy athmetc s ntoduced to successfully
More informationRanks of quotients, remainders and p-adic digits of matrices
axv:1401.6667v2 [math.nt] 31 Jan 2014 Ranks of quotents, emandes and p-adc dgts of matces Mustafa Elshekh Andy Novocn Mak Gesbecht Abstact Fo a pme p and a matx A Z n n, wte A as A = p(a quo p)+ (A em
More informationInformation Retrieval (Relevance Feedback & Query Expansion)
Infomation Retieval (Relevance Feedback & Quey Epansion) Fabio Aiolli http://www.math.unipd.it/~aiolli Dipatimento di Matematica Univesità di Padova Anno Accademico 1 Relevance feedback and quey epansion
More informationCOMPLEMENTARY ENERGY METHOD FOR CURVED COMPOSITE BEAMS
ultscence - XXX. mcocd Intenatonal ultdscplnay Scentfc Confeence Unvesty of skolc Hungay - pl 06 ISBN 978-963-358-3- COPLEENTRY ENERGY ETHOD FOR CURVED COPOSITE BES Ákos József Lengyel István Ecsed ssstant
More informationTest 1 phy What mass of a material with density ρ is required to make a hollow spherical shell having inner radius r i and outer radius r o?
Test 1 phy 0 1. a) What s the pupose of measuement? b) Wte all fou condtons, whch must be satsfed by a scala poduct. (Use dffeent symbols to dstngush opeatons on ectos fom opeatons on numbes.) c) What
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationSOME NEW SELF-DUAL [96, 48, 16] CODES WITH AN AUTOMORPHISM OF ORDER 15. KEYWORDS: automorphisms, construction, self-dual codes
Факултет по математика и информатика, том ХVІ С, 014 SOME NEW SELF-DUAL [96, 48, 16] CODES WITH AN AUTOMORPHISM OF ORDER 15 NIKOLAY I. YANKOV ABSTRACT: A new method fo constuctng bnay self-dual codes wth
More informationE For K > 0. s s s s Fall Physical Chemistry (II) by M. Lim. singlet. triplet
Eneges of He electonc ψ E Fo K > 0 ψ = snglet ( )( ) s s+ ss αβ E βα snglet = ε + ε + J s + Ks Etplet = ε + ε + J s Ks αα ψ tplet = ( s s ss ) ββ ( αβ + βα ) s s s s s s s s ψ G = ss( αβ βα ) E = ε + ε
More informationPushdown Automata (PDAs)
CHAPTER 2 Context-Fee Languages Contents Context-Fee Gammas definitions, examples, designing, ambiguity, Chomsky nomal fom Pushdown Automata definitions, examples, euivalence with context-fee gammas Non-Context-Fee
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More information