LEARNING THE SIMILARITY OF AUDIO MUSIC IN BAG-OF- FRAMES REPRESENTATION FROM TAGGED MUSIC DATA
|
|
- Martin Smith
- 6 years ago
- Views:
Transcription
1 2th International Society for Music Inforation Retrieval Conference (ISMIR 20) LEARNING THE SIMILARITY OF AUDIO MUSIC IN BAG-OF- FRAMES REPRESENTATION FROM TAGGED MUSIC DATA Ju-Chiang Wang,2, Hung-Shin Lee,2, Hsin-Min Wang 2 and Shyh-Kang Jeng Departent of Electrical Engineering, National Taiwan University, Taipei, Taiwan 2 Institute of Inforation Science, Acadeia Sinica, Taipei, Taiwan {asriver, hslee, wh}@iis.sinica.edu.tw, sjeng@cc.ee.ntu.edu.tw ABSTRACT Due to the cold-start proble, easuring the siilarity between two pieces of audio usic based on their low-level acoustic features is critical to any Music Inforation Retrieval (MIR) systes. In this paper, we apply the bag-offraes (BOF) approach to represent low-level acoustic features of a song and exploit usic tags to help iprove the perforance of the audio-based usic siilarity coputation. We first introduce a Gaussian ixture odel (GMM) as the encoding reference for BOF odeling, then we propose a novel learning algorith to iniize the siilarity gap between low-level acoustic features and usic tags with respect to the prior weights of the pre-trained GMM. The results of audio-based query-by-exaple MIR experients on the MajorMiner and Magnatagatune datasets deonstrate the effectiveness of the proposed ethod, which gives a potential to guide MIR systes that eploy BOF odeling.. INTRODUCTION Measuring the siilarity between two pieces of usic is a fundaental but difficult tas in Music Inforation Retrieval (MIR) research [] since usic siilarity is inherently based on huan subjective point of view and can be bias aong people who have different usical tastes and prior nowledge. A piece of usic contains a variety of usical contents, including the low-level audio signal; the etadata, such as the artist, albu, song nae, and release year; and a nuber of high-level perceptive descriptions, such as tibre, instruentation, style/genre, ood, and social inforation (e.g., tags, blogs, and explicit or iplicit user feedbac). Aong the usical contents, only the audio signal is always available while the etadata and highlevel perceptive descriptions are often unavailable or ex- This wor was supported in part by the Taiwan e-learning and Digital Archives Progra (TELDAP) sponsored by the National Science Council of Taiwan under Grant: NSC H Perission to ae digital or hard copies of all or part of this wor for personal or classroo use is granted without fee provided that copies are not ade or distributed for profit or coercial advantage and that copies bear this notice and the full citation on the first page. 20 International Society for Music Inforation Retrieval pensive to obtain. Owing to the cold-start proble, easuring the siilarity between two pieces of audio usic based on their low-level acoustic features is critical to any MIR systes [2, 3]. These systes are usually evaluated against the objective criteria derived fro the etadata and highlevel perceptive descriptions, which in fact correspond to the subjective criteria that huans use to easure usic siilarity. The siilarity gap between the acoustic features and huan subjective perceptions inevitably degrades the perforances of the MIR systes. The gap ay coe fro an insufficient song-level acoustic feature extraction or representation and an ill siilarity etric. Therefore, the goal of iproving audio-based usic siilarity coputation is to reduce the gap between audio features and huan perceptions, and it can be achieved fro a usic feature representation perspective [3-8] or a siilarity learning perspective [, 0]. Due to the glass ceiling of perforance that the pure audio-based usic siilarity coputation systes have faced, several high-level perceptive descriptions, which are considered having a saller gap between the siilarity coputed on the and the subjective siilarity of huan, have been eployed in soe previous wor. For exaple, in [6, 7], an interediate seantic space (e.g. genre or text caption) is used to bridge and reduce the siilarity gap. During recent years, social inforation has been very popular and becoe a ajor source of contextual nowledge for MIR systes. The social inforation generated by Internet users aes the wisdo of crowds available for investigating the general criteria of huan subjective usic siilarity. In [], the usic blogs are exploited to learn the usic siilarity etric of audio features. In [8], the social tags are concatenated with the audio features to represent usic in a query-by-exaple MIR scenario. Furtherore, Ki et al. [9] conduct explicit and iplicit user feedbac, which can be ipleented by collaborative filtering (CF, the user-artist atrix), to easure artist siilarity. Surprisingly, the experiental results show that CF can be a very efficient source in usic siilarity coputation. Afterwards, the CF data is used in [0] to learn the audio-based siilarity etric and significant iproveents in query-byexaple MIR perforance are achieved with three types of song-level representations, naely, acoustic, auto-tag, and huan-tag representations. 85
2 Poster Session In the aboveentioned wor, usic tags are ostly treated as part of usic features to represent a song [8-0]. In this paper, we adopt usic tags to create a ground truth seantic space to be used to easure huan subjective siilarity for three reasons. First, usic tags are huan labels that represent huan usical perceptions. According to previous studies [9, 0], the siilarity fro tags is highly relative to the subjective siilarity for evaluation, i.e., the siilarity gap is relatively sall. Second, usic tags are free-text labels that include all inds of usical inforation, such as genre, ood, instruentation, personal preference, and etadata, which are used to objectively evaluate the effectiveness of audio-based siilarity coputation in previous wor. Third, usic tags are generally considered noisy, redundant, bias, and unstable when collected fro a copletely non-constrained tagging environent, such as last.f. Consequently, several web-based usic tagging gaes have been created with a purpose of collecting reliable and useful tags, e.g., MajorMiner.org [2] and Tag A Tune [3]. In these tagging gaes, usic clips are randoly assigned to taggers in order to reduce the tagging bias. Carefully extracting tags with high ter frequencies and erging equivalent tags can intuitively reduce the noisy factors. With a set of well-refined usic tags, the seantic space which siulates the huan usic siilarity can be established. In ost audio-based MIR systes, the sequence of shorttie frae-based or segent-based acoustic feature vectors of a song is converted into a fixed-diensional vector so that the song-level seantic descriptions (or tags) can be incorporated into it. The bag-of-fraes (BOF) or bag-ofsegents approach is a popular and efficient way to represent a set of frae-based acoustic vectors of a song and has been widely used in MIR applications [8,0,4]. In the traditional BOF approach, a set of frae representatives (e.g., codeboo, denoted as an encoding reference hereafter) are selected or learned in an unsupervised anner, then a song is represented by the histogra over the encoding reference. In the BOF representation vector, each diension represents the effective quantity of its corresponding frae representative (e.g., codeword) within a song. Based on the effective quantities, we can estiate the audio-based siilarity of two songs. Motivated by the etric learning for audio-based usic siilarity coputation in [, 0], we could learn a etric transforation over the BOF representation vector by iniizing the siilarity gap between acoustic features and usic tags. Since the BOF vector is generated by the encoding reference, the iniization of siilarity gap can be achieved by learning the encoding reference rather than learning a etric transforation on the native BOF space. This leads to a supervised ethod for learning the encoding reference fro a tagged usic dataset to iprove the BOF representation. Hopefully, the learned encoding reference could better generalize the BOF odeling than a stacing transforation over the native etric. The reainder of this paper is organized as follows. Section 2 describes the audio feature extraction odule and song-level BOF representation. In Section 3, we introduce the ethod for learning the encoding reference fro the tagged usic data. In Section 4, we evaluate the proposed ethod on the MajorMiner and Magnatagatune datasets in a query-by-exaple MIR scenario. Finally, we suarize our conclusions in Section BAG-OF-FRAMES REPRESENTATION FOR ACOUSTIC FEATURES 2. Frae-based Acoustic Feature Extraction We use MIRToolbox.3 for acoustic feature extraction [4]. As shown in Table, we consider four types of features, naely, dynaic, spectral, tibre, and tonal features. To ensure alignent and prevent isatch of different features in a vector, all the features are extracted with the sae fixed-sized short-tie frae. Given a song, a sequence of 70-diensional feature vectors is extracted with a 50s frae size and 0.5 hop shift. Then, we noralize the 70- diensional frae-based feature vectors in each diension to ean 0 and standard deviation. Types Feature Description Di dynaic rs spectral centroid, spread, sewness, urtosis, entropy, flatness, rolloff 85, rolloff 95, bright- ness, roughness, irregularity tibre zero crossing rate, spectral flux, MFCC, 4 delta MFCC, delta-delta MFCC tonal ey clarity, ey ode possibility, HCDF, chroa, chroa pea, chroa centroid 7 Table. The usic features used in the 70-diensional fraebased usic feature vector. 2.2 The Encoding Reference and BOF Representation The BOF approach is argued that each frae of a song should not be treated equally, and an isolated frae of lowlevel acoustic feature is not representative for high-level perceptive descriptions [5]. Besides, the effectiveness of BOF odeling is highly ipacted by the size of encoding reference and will encounter a glass ceiling when the size is too large [6]. Our goal of iproving the encoding reference for BOF odeling is twofold: First, we ai at choosing a type of frae representative that gives better generalization ability and a ore reliable distance easure criterion. Second, each frae representative should not have equal inforation load during song-level encoding. The BOF odeling starts with generating the encoding reference fro a set of available fraes (denoted as F). The fraes are usually selected randoly and uniforly fro each song in a usic dataset. We use a Gaussian ixture odel (GMM) instead of a codeboo derived by the K- ean algorith as the encoding reference [7]. In the 86
3 2th International Society for Music Inforation Retrieval Conference (ISMIR 20) GMM, each coponent Gaussian distribution, denoted as z, =,,K, corresponds to a frae representative. The GMM is trained on F by the expectation-axiization (EM) algorith, and is expressed as follows: K p( v) = π ( v μ, Σ ), () = N where v is a frae-based feature vector, N ( ) is the -th coponent Gaussian distribution with ean vector μ and covariance atrix Σ, and π is the prior weight of the -th ixture coponent. Given v, the posterior probability of a ixture coponent is coputed by: p( z v) = K = π N ( v μ, Σ ) π N ( v μ, Σ Given a song s with L fraes, its BOF posterior-probability representation (denoted as vector x) is coputed by: L x p( z s) = p( z v t ), (3) L t= where x is the -th eleent in vector x. When encoding a frae by GMM, the posterior probability is based on the lielihood of each coponent Gaussian distribution. The posterior probability of each ixture coponent yields a soft-assigned encoding criterion which enhances the odeling ability of the GMM-based encoding reference over the vector-quantization-based (VQ-based) one. Our contention is that the diversity of frae representatives in the encoding reference is proportional to the ability of the BOF odeling, i.e., the BOF odeling can involve ore audio inforation of a song to be encoded. However, lie other encoding references (e.g., a set of randoly selected vectors or a trained codeboo), the GMM is generated in an unsupervised anner. The factors that we can control includes the nuber of coponents in GMM, i.e., K, the types of acoustic features used in the frae-based vector, and the construction of F. Except for K, the other two factors are fixed in the beginning. As K increases, the frae representatives becoe ore diverse, but soe of the are in fact redundant. This otivates us to deterine the iportance of each frae representative in a discriinative way. The EM training for GMM provides the estiation of the data distribution over F, which is assued to follow a ixture of Gaussian distributions, by the axiu lielihood criterion. The prior π of the -th coponent Gaussian represents the corresponding effective nuber of fraes in training set F. However, the construction of F iplies that the estiated distribution of F actually does not have inforation about the song-level distribution of acoustic feature vectors. In other words, it ay not reflect the iportance of each ixture coponent when encoding a song. In fact, as will be discussed later in Sec. 4, our experiental results show that setting the trained priors to a unifor distribution iproves the MIR perforance.. ) (2) In light of the observations described above and the beneficial characteristics of usic tags, we readily incorporate the tagged usic data as a supervision guide to deterine the iportance of each ixture coponent in the GMM. 3. LEARNING THE AUDIO-BASED SIMILARITY In this wor, learning the siilarity of audio usic fro tagged usic data is achieved by learning the encoding reference to iniize the siilarity gap between low-level acoustic features and high-level usic tags. To this end, we conduct learning with respect to the paraeters of the GMM trained fro F. In this paper, we only consider the relearning of the prior probabilities, i.e., the pre-learned paraeters μ and Σ, =,,K, are fixed. The proposed iterative learning algorith has two steps, naely, encoding songs into BOF vectors and iniizing the siilarity gap with respect to the prior probabilities of the GMM. 3. Preliinary Suppose there is a tagged usic corpus D with N songs. Given a song s i in D, we have its BOF vector x i R K, which is encoded by the GMM to represent the acoustic features, and its tag vector y i {0,} M, in which each tag is binary labeled (ulti-label case) fro a pre-defined tag set with M tags. Two siilarity atrices are defined: S X is coputed on the N BOF vectors, and S Y is coputed on the N tag vectors. We estiate the acoustic siilarity between s i and s j in D by coputing the inner product of x i and x j. Therefore, the acoustic siilarity atrix S X of D can be expressed as: S = X T X, (4) X where X is a K-by-N atrix with x i as its i-th colun. The tag siilarity atrix S Y of D is expressed as: S = Y T Y, (5) Y where Y is an M-by-N atrix with y i y i as its i-th colun. Since each song ay have different nubers of tags, to ensure that the tag-based siilarity of a song itself is always the largest, we copute the cosine siilarity between y i and y j in Eq. (5) to estiate the tag-based siilarity to siulate the huan siilarity between s i and s j. The ethods for audio-based siilarity coputation can be evaluated by a query-by-exaple MIR syste, i.e., given a query song with the audio signal only, the syste rans all the songs in the database based on audio-based siilarity coputation only. To evaluate the effectiveness of S X, we perfor leave-one-out MIR tests to evaluate the noralized discounted cuulative gain () [8] with respect to the ground truth relevance derived by S Y. That is, each song s i in D is taen as a query song in turn, the output raned list for s i is generated by sorting the eleents in the i-th row of S X in descending order, and the corresponding ground truth relevance is the i-th row of S Y. The 87
4 Poster Session which represents the quality of raning of the top P retrieved songs for query s i, is forulated as follows: P Ri ( j) P = Ri () +, 2 log2 (6) QP j= j where R i (j) is the ground truth relevance (obtained fro the i-th row of S Y ) of the j-th song on the raned list, and Q P is the noralization ter representing the ideal raning of the P songs [8]. Intuitively, if ore songs with large ground truth relevance are raned higher, a larger will be obtained. The query-by-exaple MIR perforance on D based on S X with respect to S Y is evaluated by N ( D )@ P = P. (7) N i= The larger in Eq. (7) is, the ore effective the audio siilarity coputation for S X is. 3.2 Miniizing the Siilarity Gap We define a K-by-K syetric transforation atrix W for the BOF vector space. The transfored BOF vector for s i is expressed by Wx i, and the new acoustic siilarity atrix S T of D can be obtained by: T T S = ( WX) ( WX) = X TX, (8) T where T=W T W. Therefore, iniizing the siilarity gap between the transfored BOF vector space and huan tag vector space is equivalent to iniizing the distance or axiizing the correlation [9] between the two ernel atrices S T and S Y with respect to W. In this paper, otivated by the wor in [20], we express the N songs in D as two rando vectors, Z x R N for the transfored acoustic feature and Z y R N for the tag label, which follow two ultivariate Gaussian distributions N x and N y, respectively. There exists a siple bijection between the two ultivariate Gaussians. Without loss of generality, we assue N x and N y have an equal ean and are paraeterized by (μ, S T ) and (μ, S Y ), respectively. Then, the closeness between N x and N y can be easured by the relative entropy KL(N x N y ) (i.e., the KL-divergence), which is equivalent to d(s T S Y ): d( ST SY ) = { tr( ST SY ) log ST SY N }, (9) 2 where tr( ) and are the trace and deterinant of a atrix, respectively. The iniization of d(s T S Y ) can be solved by setting the derivative of d(s T S Y ) with respect to T to zero. The solution that iniizes d(s T S Y ) is as follows: T ( X( S ) X ). T (0) * = Y Since W is syetric, the optial atrix W is derived by * * 2 W = ( T ). () To prevent singularity, a sall value 0.00 is added to each diagonal eleent of the atrices that are inversed in solving W. If we restrict W in Eq. (8) to be diagonal, i.e., we ignore the correlation aong different diensions in the BOF vector, and define vector w diag(w), the optial w * is the diagonal of W * : * * w = diag( W ), (2) where each eleent in w * ust be greater than zero. The derivations of Eqs. (0) and (2) are sipped due to the space liitation. In the testing phase, each song is first encoded into a BOF vector by the GMM using Eq. (3). Then, the audiobased siilarity between any two songs s i and s j is coputed as x i T T * x j, where T * can be a full or diagonal atrix according to the initial setting of W in Eq. (8). In the experients, this ethod with full transforation and diagonal transforation is denoted as and respectively, while the ethod without transforation is denoted as (i.e., the native GMM). 3.3 Relearning the Priors of the GMM Instead of learning a transforation atrix, we can also iniize the siilarity gap by relearning the prior weights of the GMM. We propose a two-step iterative learning ethod, which iteratively updates the prior weights of the GMM until convergence. The in Eq. (7) can be used as the criterion for checing the convergence of the learning procedure. The iniization of siilarity gap iplies the iproveent in since the learned S T tries to preserve the structure of S Y, which is used as the ground truth relevance in coputing. If is no longer iproved, the learning algorith stops. The learning ethod is suarized in Algorith. According to Algorith, there are two steps in an iteration. Line 05 corresponds to the first step, which encodes all songs into their BOF vectors; and lines and 3 correspond to the second step, which iniizes the siilarity gap with respect to the prior weights of the GMM. Since encoding all songs in D is a coplicated procedure, directly optiizing with respect to the paraeters of the GMM with Eqs. (), (2) and (3) is infeasible. Therefore, we turn to find an indirect solution that iniizes the siilarity gap with respect to the priors of the GMM. We exploit the property of w * to derive Eq. (3), which serves as an indirect optiizer for axiizing the (D)@N by reweighting the prior weights of the GMM. Intuitively, the vector w * derived in line plays a role to select ixture coponents in the GMM. In the testing phase, each song is encoded into a BOF vector by the GMM with the relearned prior weights using Eq. (3). Then, the audio-based siilarity between any two songs s i and s j is coputed as the inner product of x i and x j, without the need to apply any stacing transforation in the BOF space. In the experients, the proposed ethod ipleented in this way is denoted as. 88
5 2th International Society for Music Inforation Retrieval Conference (ISMIR 20) Algorith. The learning algorith Input: Initial GMM paraeters {μ, Σ }, =,,K; A tagged usic corpus D: a set of fraes V i for s i, i=,,n, and tag siilarity atrix S Y fro Eq. (5); Output: Learned GMM prior { πˆ }; (0) 0: Initialize π to be /K; 02: Iteration index t 0; 03: L(t) 0; 04: while t 0 do 05: ( t) Encode V i into x i with Eq. (3) using { π,μ, Σ }; 06: Copute S X with Eq. (4); 07: t t + ; 08: L(t) (D)@N with Eq. (7) using S X and S Y ; 09: If (L(t)-L(t-))/L(t) < 0 then ( ) 0: Return ˆ π t π and brea; : Copute w * with Eq. (2) using S X and S Y ; 2: for =,,K, do 3: ( t ) ( t) wπ π K ; ( t ) q = w qπ q (3) (where w is the -th eleent in w * ) 4: end for 5: end while 4. Datasets 4. EVALUATIONS We evaluate the proposed ethod on the MajorMiner and Magnatagatune datasets in a query-by-exaple MIR scenario. Both datasets are generated fro social tagging gaes with a purpose (GWAP) [, 2] to collect reliable and useful tag labels. The MajorMiner dataset has been a well-nown benchar in MIREX since The one used in this paper is crawled fro the MajorMiner website in March 20. It contains 2,472 0-second usic clips and,03 raw tags. After exacting the high frequency tags and erging the redundant tags, 76 tags are left. The Magnatagatune dataset [2], which contains 25, second audio clips and 88 pre-processed tags, is downloaded fro [2]. To construct F, we randoly select 25% and 2% of fraes fro the two datasets, respectively. For MajorMiner, F contains 235,000 fraes, while for Magnatagatune, F contains 535,800 fraes. The F constructed in this way is blind to song-level inforation. To prevent bias in the tagbased siilarity coputation of S Y, we ignore the clips labeled with fewer tags. For the MajorMiner dataset,,200 clips having at least 5 tags are left. For the Magnatagatune dataset, 3,764 clips having at least 7 tags are left. 4.2 Experiental Results and Discussions In the experients, we repeat three-fold cross-validation 0 ties on the MajorMiner dataset, which is divided The Convergence of (K=256) Iteration The Convergence of (K=256) Iteration three folds at rando. In each run, two folds are used for training the transforation atrix of the and ethods or relearning the prior weights of the GMM for the ethod, while the reaining fold, which serves as both the test queries and the target database to retrieve, is used for the leave-one-out audio-based MIR outside test. For the Magnatagatune dataset, all clips have been divided into 6 folds to prevent that two or ore clips originated fro the sae song occur in different folds. We erge the 6 folds into 4 folds and perfor four-fold cross-validation. in Eq. (7) is used as the evaluation etric in both inside and outside tests. First, we exaine the learning process of on the MajorMiner dataset. Figure shows an exaple learning curve in ters of for one of the three-fold crossvalidation runs. The curve is equivalent to the inside test perforance evaluated on the training data. We can see that the learning curve of (K=256) increases onotonically till convergence, although can only iprove the of the training data indirectly as discussed in Section 3.3. gains an absolute increase of 0.04 and The of can be considered an upper bound for since it adopts a direct optiization strategy. Next, we evaluate and the VQ-based ethod on the MajorMiner dataset. There is no need to divide the data into three folds since no supervised learning is involved in the ethods. Fro the MIR results shown in Table 2, we observe that replacing the priors of the GMM trained fro F with a unifor distribution enhances the perforance. We also observe that, even with a large K, outperfors VQ-based BOF odeling. The results deonstrate the better odeling ability of the GMM over the K-eans derived codeboo. Finally, we copare with three baselines, i.e.,,, and. The results of threefold cross-validation on the MajorMiner dataset are shown in Figure 2, while the results of four-fold cross-validation on the Magnatagatune dataset are shown in Figure 3. Fro Figures 2 and 3, it is obvious that the proposed outperfors all other ethods in ost cases. The conventional BOF approach does face a glass ceiling when K (a) (b) Figure. The learning curve in ters of and evaluated on the MajorMiner training data. 89
6 Poster Session too large, as evidenced by the observation that the perforance of saturates at around K=,024 for MajorMiner (0-second clips) and K=2,048 for Magnatagatune (30-second clips). The proposed enhances the perforance over the glass ceiling of with a saller K, e.g., with K=52 outperfors with K=2,048 on the MajorMiner dataset. Full- Trans outperfors and only when K is sall. However, tends to saturate early since it has ore paraeters to train and thus requires ore training data, copared with and. In Figure, the perforance of shows an upper bound of in inside test; however, in outside test, outperfors except when K is sall. The experiental results in Figures 2 and 3 deonstrate the excellent generalization ability of, which learns the siilarity of audio usic by relearning the priors of the GMM instead of a transforation in the BOF vector space. 5. CONCLUSIONS In this paper, we have addressed a novel research direction that the audio-based usic siilarity coputation can be learned by iniizing the siilarity gap or axiizing the easure with respect to the paraeters of the encoding reference in BOF representation. We have ipleented the idea by learning the prior weights of the GMM fro tagged usic data. The experiental results deonstrate the effectiveness of the proposed ethod, which gives a potential to guide MIR systes that eploy BOF representation, e.g., the can be directly cobined with the codeword Bernoulli average (CBA) ethod [3], a well-nown autoatic usic (K=2,048) w/o Prior (K=2,048) w Prior VQ-based (K=2,048) Histogra Table 2. The results of and the VQ-based ethod on the coplete MajorMiner dataset (,200 clips) MajorMiner P= REFERENCES [] M. Slaney, K. Weinberger, and W. White: Learning a etric for usic siilarity, ISMIR, [2] J.-J. Aucouturier and F. Pachet: Music siilarity easures: What s the use?, ISMIR, [3] M. Mandel and D. Ellis: Song-level features and SVMs for usic classification, ISMIR, [4] E. Papal: Audio-based usic siilarity and retrieval: Cobining a spectral siilarity odel with inforation extracted fro fluctuation patterns, ISMIR, [5] M. Hoffan, D. Blei and P. Coo: Content-based usical siilarity coputation using the hierarchical Dirichlet process, ISMIR, [6] K. West and P. Laere: A odel-based approach to constructing usic siilarity functions, EURASIP Journal on Advances in Signal Processing, 2007(), 0, [7] L. Barrington, A. Chan, D. Turnbull, and G. Lancriet: Audio inforation retrieval using seantic siilarity, ICASSP, [8] M. Levy and M. Sandler: Music inforation retrieval using social tags and audio, IEEE TMM, (3), , [9] J. H. Ki, B. Toasi, and D. Turnbull: Using artist siilarity to propagate seantic inforation, ISMIR, [0] B. McFee, L. Barrington and G. Lancriet: Learning siilarity fro collaborative filters, ISMIR, 200. [] M. Mandel and D. Ellis: A web-based gae for collecting usic etadata, J. New Mus. Res., 37(2), 5 65, [2] E. Law and L. von Ahn: Input-agreeent: A new echanis for data collection using huan coputation gaes, ACM CHI, [3] M. Hoffan, D. Blei and P. Coo: Easy as CBA: A siple probabilistic odel for tagging usic, ISMIR, [4] O. Lartillot and P. Toiviainen: A Matlab toolbox for usical feature extraction fro audio, DAFx, [5] G. Marques, et al.: Additional evidence that coon lowlevel features of individual audio fraes are not representative of usic genre, SMC Conference, 200. [6] J.-J. Aucouturier, B. Defreville and F. Pachet: The bag-offraes approach to audio pattern recognition: A sufficient odel for urban soundscapes but not for polyphonic usic, J. Acoust. Soc. A., 22(2), 88 9, [7] K. Yoshii, M. Goto, K. Koatani, T. Ogata, and H. G. Ouno: An efficient hybrid usic recoender syste using an increentally trainable probabilistic generative odel, IEEE TASLP, 6(2), , [8] K. Jarvelin and J. Kealainen: Cuulated gain-based evaluation of IR techniques, ACM Trans. on Inforation Systes, 20(4), , [9] Y. Zhang and Z.-H. Zhou: Multi-label diensionality reduction via dependence axiization, AAAI, [20] J. V. Davis, B. Kulis, P. Jain, S. S. and I. S. Dhillon: Inforation-theoretic etric learning, ICML, [2] MajorMiner P=0 Figure 2. The results in ters on the MajorMiner dataset with different K. 5 4 Magnatagatune P= Magnatagatune P= Figure 3. The results in ters on the Magnatagatune dataset with different K. 90
Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis
City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationHandwriting Detection Model Based on Four-Dimensional Vector Space Model
Journal of Matheatics Research; Vol. 10, No. 4; August 2018 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Handwriting Detection Model Based on Four-Diensional Vector
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationAn improved self-adaptive harmony search algorithm for joint replenishment problems
An iproved self-adaptive harony search algorith for joint replenishent probles Lin Wang School of Manageent, Huazhong University of Science & Technology zhoulearner@gail.co Xiaojian Zhou School of Manageent,
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationA Smoothed Boosting Algorithm Using Probabilistic Output Codes
A Soothed Boosting Algorith Using Probabilistic Output Codes Rong Jin rongjin@cse.su.edu Dept. of Coputer Science and Engineering, Michigan State University, MI 48824, USA Jian Zhang jian.zhang@cs.cu.edu
More informationAn Improved Particle Filter with Applications in Ballistic Target Tracking
Sensors & ransducers Vol. 72 Issue 6 June 204 pp. 96-20 Sensors & ransducers 204 by IFSA Publishing S. L. http://www.sensorsportal.co An Iproved Particle Filter with Applications in Ballistic arget racing
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationNonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy
Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationIntelligent Systems: Reasoning and Recognition. Artificial Neural Networks
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationPAC-Bayes Analysis Of Maximum Entropy Learning
PAC-Bayes Analysis Of Maxiu Entropy Learning John Shawe-Taylor and David R. Hardoon Centre for Coputational Statistics and Machine Learning Departent of Coputer Science University College London, UK, WC1E
More informationCorrelated Bayesian Model Fusion: Efficient Performance Modeling of Large-Scale Tunable Analog/RF Integrated Circuits
Correlated Bayesian odel Fusion: Efficient Perforance odeling of Large-Scale unable Analog/RF Integrated Circuits Fa Wang and Xin Li ECE Departent, Carnegie ellon University, Pittsburgh, PA 53 {fwang,
More informationConvolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder
Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationAn Adaptive UKF Algorithm for the State and Parameter Estimations of a Mobile Robot
Vol. 34, No. 1 ACTA AUTOMATICA SINICA January, 2008 An Adaptive UKF Algorith for the State and Paraeter Estiations of a Mobile Robot SONG Qi 1, 2 HAN Jian-Da 1 Abstract For iproving the estiation accuracy
More informationUse of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization
Use of PSO in Paraeter Estiation of Robot Dynaics; Part One: No Need for Paraeterization Hossein Jahandideh, Mehrzad Navar Abstract Offline procedures for estiating paraeters of robot dynaics are practically
More informationIdentical Maximum Likelihood State Estimation Based on Incremental Finite Mixture Model in PHD Filter
Identical Maxiu Lielihood State Estiation Based on Increental Finite Mixture Model in PHD Filter Gang Wu Eail: xjtuwugang@gail.co Jing Liu Eail: elelj20080730@ail.xjtu.edu.cn Chongzhao Han Eail: czhan@ail.xjtu.edu.cn
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationLower Bounds for Quantized Matrix Completion
Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationTracking using CONDENSATION: Conditional Density Propagation
Tracking using CONDENSATION: Conditional Density Propagation Goal Model-based visual tracking in dense clutter at near video frae rates M. Isard and A. Blake, CONDENSATION Conditional density propagation
More informationBayes Decision Rule and Naïve Bayes Classifier
Bayes Decision Rule and Naïve Bayes Classifier Le Song Machine Learning I CSE 6740, Fall 2013 Gaussian Mixture odel A density odel p(x) ay be ulti-odal: odel it as a ixture of uni-odal distributions (e.g.
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016/2017 Lessons 9 11 Jan 2017 Outline Artificial Neural networks Notation...2 Convolutional Neural Networks...3
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationInspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information
Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationRecovering Data from Underdetermined Quadratic Measurements (CS 229a Project: Final Writeup)
Recovering Data fro Underdeterined Quadratic Measureents (CS 229a Project: Final Writeup) Mahdi Soltanolkotabi Deceber 16, 2011 1 Introduction Data that arises fro engineering applications often contains
More informationFixed-to-Variable Length Distribution Matching
Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de
More informationGary J. Balas Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN USA
μ-synthesis Gary J. Balas Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN 55455 USA Keywords: Robust control, ultivariable control, linear fractional transforation (LFT),
More informationNUMERICAL MODELLING OF THE TYRE/ROAD CONTACT
NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31
More informationAn Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles
An Inverse Interpolation Method Utilizing In-Flight Strain Measureents for Deterining Loads and Structural Response of Aerospace Vehicles S. Shkarayev and R. Krashantisa University of Arizona, Tucson,
More informationQualitative Modelling of Time Series Using Self-Organizing Maps: Application to Animal Science
Proceedings of the 6th WSEAS International Conference on Applied Coputer Science, Tenerife, Canary Islands, Spain, Deceber 16-18, 2006 183 Qualitative Modelling of Tie Series Using Self-Organizing Maps:
More informationEffective joint probabilistic data association using maximum a posteriori estimates of target states
Effective joint probabilistic data association using axiu a posteriori estiates of target states 1 Viji Paul Panakkal, 2 Rajbabu Velurugan 1 Central Research Laboratory, Bharat Electronics Ltd., Bangalore,
More informationDistributed Subgradient Methods for Multi-agent Optimization
1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationEnsemble Based on Data Envelopment Analysis
Enseble Based on Data Envelopent Analysis So Young Sohn & Hong Choi Departent of Coputer Science & Industrial Systes Engineering, Yonsei University, Seoul, Korea Tel) 82-2-223-404, Fax) 82-2- 364-7807
More informationNumerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term
Nuerical Studies of a Nonlinear Heat Equation with Square Root Reaction Ter Ron Bucire, 1 Karl McMurtry, 1 Ronald E. Micens 2 1 Matheatics Departent, Occidental College, Los Angeles, California 90041 2
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationFault Tree Modeling for Redundant Multi-Functional Digital Systems
International Journal of Perforability Engineering, Vol. 3, No. 3, July, 2007, pp. 329-336 RAMS Consultants Printed in India Fault Tree Modeling for Redundant Multi-Functional Digital Systes HYUN GOOK
More informationUpper bound on false alarm rate for landmine detection and classification using syntactic pattern recognition
Upper bound on false alar rate for landine detection and classification using syntactic pattern recognition Ahed O. Nasif, Brian L. Mark, Kenneth J. Hintz, and Nathalia Peixoto Dept. of Electrical and
More informationVulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links
Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp
More informationDesign of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas
More informationW-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS
W-BASED VS LATENT VARIABLES SPATIAL AUTOREGRESSIVE MODELS: EVIDENCE FROM MONTE CARLO SIMULATIONS. Introduction When it coes to applying econoetric odels to analyze georeferenced data, researchers are well
More informationData-Driven Imaging in Anisotropic Media
18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands
More informationOBJECTIVES INTRODUCTION
M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and
More informationThe Algorithms Optimization of Artificial Neural Network Based on Particle Swarm
Send Orders for Reprints to reprints@benthascience.ae The Open Cybernetics & Systeics Journal, 04, 8, 59-54 59 Open Access The Algoriths Optiization of Artificial Neural Network Based on Particle Swar
More informationRandom Vibration Fatigue Analysis with LS-DYNA
1 th International LS-DYNA Users Conference Siulation() Rando Vibration Fatigue Analysis with LS-DYNA Arnaud Ringeval 1, Yun Huang 1 CIMES, France 36 rue Marc Lefrancq, Les Ateliers Nuériques, 593 Valenciennes,
More informationAsynchronous Gossip Algorithms for Stochastic Optimization
Asynchronous Gossip Algoriths for Stochastic Optiization S. Sundhar Ra ECE Dept. University of Illinois Urbana, IL 680 ssrini@illinois.edu A. Nedić IESE Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu
More informationA method to determine relative stroke detection efficiencies from multiplicity distributions
A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,
More informationDeflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007
Deflation of the I-O Series 1959-2. Soe Technical Aspects Giorgio Rapa University of Genoa g.rapa@unige.it April 27 1. Introduction The nuber of sectors is 42 for the period 1965-2 and 38 for the initial
More informationTesting Properties of Collections of Distributions
Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the
More informationStochastic Subgradient Methods
Stochastic Subgradient Methods Lingjie Weng Yutian Chen Bren School of Inforation and Coputer Science University of California, Irvine {wengl, yutianc}@ics.uci.edu Abstract Stochastic subgradient ethods
More informationPROXSCAL. Notation. W n n matrix with weights for source k. E n s matrix with raw independent variables F n p matrix with fixed coordinates
PROXSCAL PROXSCAL perfors ultidiensional scaling of proxiity data to find a leastsquares representation of the obects in a low-diensional space. Individual differences odels can be specified for ultiple
More informationFairness via priority scheduling
Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationKernel based Object Tracking using Color Histogram Technique
Kernel based Object Tracking using Color Histogra Technique 1 Prajna Pariita Dash, 2 Dipti patra, 3 Sudhansu Kuar Mishra, 4 Jagannath Sethi, 1,2 Dept of Electrical engineering, NIT, Rourkela, India 3 Departent
More informationCS Lecture 13. More Maximum Likelihood
CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationConstrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008
LIDS Report 2779 1 Constrained Consensus and Optiization in Multi-Agent Networks arxiv:0802.3922v2 [ath.oc] 17 Dec 2008 Angelia Nedić, Asuan Ozdaglar, and Pablo A. Parrilo February 15, 2013 Abstract We
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationMAXIMUM LIKELIHOOD BASED TECHNIQUES FOR BLIND SOURCE SEPARATION AND APPROXIMATE JOINT DIAGONALIZATION
BEN-GURION UNIVERSITY OF TE NEGEV FACULTY OF ENGINEERING SCIENCE DEPARTENT OF ELECTRICAL AND COPUTER ENGINEERING AXIU LIKELIOOD BASED TECNIQUES FOR BLIND SOURCE SEPARATION AND APPROXIATE JOINT DIAGONALIZATION
More informationFast Structural Similarity Search of Noncoding RNAs Based on Matched Filtering of Stem Patterns
Fast Structural Siilarity Search of Noncoding RNs Based on Matched Filtering of Ste Patterns Byung-Jun Yoon Dept. of Electrical Engineering alifornia Institute of Technology Pasadena, 91125, S Eail: bjyoon@caltech.edu
More informationREDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION
ISSN 139 14X INFORMATION TECHNOLOGY AND CONTROL, 008, Vol.37, No.3 REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION Riantas Barauskas, Vidantas Riavičius Departent of Syste Analysis, Kaunas
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationOptimization of ripple filter for pencil beam scanning
Nuclear Science and Techniques 24 (2013) 060404 Optiization of ripple filter for pencil bea scanning YANG Zhaoxia ZHANG Manzhou LI Deing * Shanghai Institute of Applied Physics, Chinese Acadey of Sciences,
More informationNew Bounds for Learning Intervals with Implications for Semi-Supervised Learning
JMLR: Workshop and Conference Proceedings vol (1) 1 15 New Bounds for Learning Intervals with Iplications for Sei-Supervised Learning David P. Helbold dph@soe.ucsc.edu Departent of Coputer Science, University
More informationDetermining the Robot-to-Robot Relative Pose Using Range-only Measurements
Deterining the Robot-to-Robot Relative Pose Using Range-only Measureents Xun S Zhou and Stergios I Roueliotis Abstract In this paper we address the proble of deterining the relative pose of pairs robots
More informationStatistical Logic Cell Delay Analysis Using a Current-based Model
Statistical Logic Cell Delay Analysis Using a Current-based Model Hanif Fatei Shahin Nazarian Massoud Pedra Dept. of EE-Systes, University of Southern California, Los Angeles, CA 90089 {fatei, shahin,
More informationGenetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr
More informationINNER CONSTRAINTS FOR A 3-D SURVEY NETWORK
eospatial Science INNER CONSRAINS FOR A 3-D SURVEY NEWORK hese notes follow closely the developent of inner constraint equations by Dr Willie an, Departent of Building, School of Design and Environent,
More informationBest Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence
Best Ar Identification: A Unified Approach to Fixed Budget and Fixed Confidence Victor Gabillon Mohaad Ghavazadeh Alessandro Lazaric INRIA Lille - Nord Europe, Tea SequeL {victor.gabillon,ohaad.ghavazadeh,alessandro.lazaric}@inria.fr
More informationCombining Classifiers
Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationWarning System of Dangerous Chemical Gas in Factory Based on Wireless Sensor Network
565 A publication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 59, 07 Guest Editors: Zhuo Yang, Junie Ba, Jing Pan Copyright 07, AIDIC Servizi S.r.l. ISBN 978-88-95608-49-5; ISSN 83-96 The Italian Association
More informationFigure 1: Equivalent electric (RC) circuit of a neurons membrane
Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of
More informationTransformation-invariant Collaborative Sub-representation
Transforation-invariant Collaborative Sub-representation Yeqing Li, Chen Chen, Jungzhou Huang Departent of Coputer Science and Engineering University of Texas at Arlington, Texas 769, USA. Eail: yeqing.li@avs.uta.edu,
More informationIntroduction to Machine Learning. Recitation 11
Introduction to Machine Learning Lecturer: Regev Schweiger Recitation Fall Seester Scribe: Regev Schweiger. Kernel Ridge Regression We now take on the task of kernel-izing ridge regression. Let x,...,
More informationINTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN
INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationCHAPTER 19: Single-Loop IMC Control
When I coplete this chapter, I want to be able to do the following. Recognize that other feedback algoriths are possible Understand the IMC structure and how it provides the essential control features
More information