AUC Optimization vs. Error Rate Minimization
|
|
- Darcy Simon Mitchell
- 8 years ago
- Views:
Transcription
1 AUC Optiization vs. Error Rate Miniization Corinna Cortes and Mehryar Mohri AT&T Labs Research 180 Park Avenue, Florha Park, NJ 0793, USA {corinna, Abstract The area under an ROC curve (AUC is a criterion used in any applications to easure the quality of a classification algorith. However, the objective function optiized in ost of these algoriths is the error rate and not the AUC value. We give a detailed statistical analysis of the relationship between the AUC and the error rate, including the first eact epression of the epected value and the variance of the AUC for a fied error rate. Our results show that the average AUC is onotonically increasing as a function of the classification accuracy, but that the standard deviation for uneven distributions and higher error rates is noticeable. Thus, algoriths designed to iniize the error rate ay not lead to the best possible AUC values. We show that, under certain conditions, the global function optiized by the RankBoost algorith is eactly the AUC. We report the results of our eperients with RankBoost in several datasets deonstrating the benefits of an algorith specifically designed to globally optiize the AUC over other eisting algoriths optiizing an approiation of the AUC or only locally optiizing the AUC. 1 Motivation In any applications, the overall classification error rate is not the ost pertinent perforance easure, criteria such as ordering or ranking see ore appropriate. Consider for eaple the list of relevant docuents returned by a search engine for a specific query. That list ay contain several thousand docuents, but, in practice, only the top fifty or so are eained by the user. Thus, a search engine s ranking of the docuents is ore critical than the accuracy of its classification of all docuents as relevant or not. More generally, for a binary classifier assigning a real-valued score to each object, a better correlation between output scores and the probability of correct classification is highly desirable. A natural criterion or suary statistic often used to easure the ranking quality of a classifier is the area under an ROC curve (AUC [8]. 1 However, the objective function optiized by ost classification algoriths is the error rate and not the AUC. Recently, several algoriths have been proposed for aiizing the AUC value locally [4] or aiizing soe approiations of the global AUC value [9, 15], but, in general, these algoriths do not obtain AUC values significantly better than those obtained by an algorith designed to iniize the error rates. Thus, it is iportant to deterine the relationship between the AUC values and the error rate. This author s new address is: Google Labs, 1440 Broadway, New York, NY 10018, corinna@google.co. 1 The AUC value is equivalent to the Wilcoon-Mann-Whitney statistic [8] and closely related to the Gini inde [1]. It has been re-invented under the nae of L-easure by [11], as already pointed out by [], and slightly odified under the nae of Linear Ranking by [13, 14].
2 True positive rate ROC Curve. AUC0.718 (1,1 (0,0 False positive rate True positive rate False positive rate correctly classified positive total positive incorrectly classified negative total negative Figure 1: An eaple of ROC curve. The line connecting (0, 0 and (1, 1, corresponding to rando classification, is drawn for reference. The true positive (negative rate is soeties referred to as the sensitivity (resp. specificity in this contet. In the following sections, we give a detailed statistical analysis of the relationship between the AUC and the error rate, including the first eact epression of the epected value and the variance of the AUC for a fied error rate. We show that, under certain conditions, the global function optiized by the RankBoost algorith is eactly the AUC. We report the results of our eperients with RankBoost in several datasets and deonstrate the benefits of an algorith specifically designed to globally optiize the AUC over other eisting algoriths optiizing an approiation of the AUC or only locally optiizing the AUC. Definition and properties of the AUC The Receiver Operating Characteristics (ROC curves were originally developed in signal detection theory [3] in connection with radio signals, and have been used since then in any other applications, in particular for edical decision-aking. Over the last few years, they have found increased interest in the achine learning and data ining counities for odel evaluation and selection [1, 10, 4, 9, 15, ]. The ROC curve for a binary classification proble plots the true positive rate as a function of the false positive rate. The points of the curve are obtained by sweeping the classification threshold fro the ost positive classification value to the ost negative. For a fully rando classification, the ROC curve is a straight line connecting the origin to (1, 1. Any iproveent over rando classification results in an ROC curve at least partially above this straight line. Fig. (1 shows an eaple of ROC curve. The AUC is defined as the area under the ROC curve and is closely related to the ranking quality of the classification as shown ore forally by Lea 1 below. Consider a binary classification task with positive eaples and n negative eaples. We will assue that a classifier outputs a strictly ordered list for these eaples and will denote by 1 X the indicator function of a set X. Lea 1 ([8] Let c be a fied classifier. Let 1,..., be the output of c on the positive eaples and y 1,..., y n its output on the negative eaples. Then, the AUC, A, associated to c is given by: A n i1 j1 1 i>y j n that is the value of the Wilcoon-Mann-Whitney statistic [8]. (1 Proof. The proof is based on the observation that the AUC value is eactly the probability P(X > Y where X is the rando variable corresponding to the distribution of the outputs for the positive eaples and Y the one corresponding to the negative eaples [7]. The Wilcoon-Mann-Whitney statistic is clearly the epression of that probability in the discrete case, which proves the lea [8]. Thus, the AUC can be viewed as a easure based on pairwise coparisons between classifications of the two classes. With a perfect ranking, all positive eaples are ranked higher than the negative ones and A 1. Any deviation fro this ranking decreases the AUC. An attept in that direction was ade by [15], but, unfortunately, the authors analysis and the result are both wrong.
3 Threshold θ k Positive eaples n Negative eaples Negative eaples (k Positive eaples Figure : For a fied nuber of errors k, there ay be,0 k, false negative eaples. 3 The Epected Value of the AUC In this section, we copute eactly the epected value of the AUC over all classifications with a fied nuber of errors and copare that to the error rate. Different classifiers ay have the sae error rate but different AUC values. Indeed, for a given classification threshold θ, an arbitrary reordering of the eaples with outputs ore than θ clearly does not affect the error rate but leads to different AUC values. Siilarly, one ay reorder the eaples with output less than θ without changing the error rate. Assue that the nuber of errors k is fied. We wish to copute the average value of the AUC over all classifications with k errors. Our odel is based on the siple assuption that all classifications or rankings with k errors are equiprobable. One could perhaps argue that errors are not necessarily evenly distributed, e.g., eaples with very high or very low ranks are less likely to be errors, but we cannot justify such biases in general. For a given classification, there ay be, 0 k, false positive eaples. Since the nuber of errors is fied, there are k false negative eaples. Figure 3 shows the corresponding configuration. The two regions of eaples with classification outputs above and below the threshold are separated by a vertical line. For a given, the coputation of the AUC, A, as given by Eq. (1 can be divided into the following three parts: A A 1 + A + A 3, with ( n A 1 the su over all pairs ( i, y j with i and y j in distinct regions; A the su over all pairs ( i, y j with i and y j in the region above the threshold; A 3 the su over all pairs ( i, y j with i and y j in the region below the threshold. The first ter, A 1, is easy to copute. Since there are ( (k positive eaples above the threshold and n negative eaples below the threshold, A 1 is given by: A 1 ( (k (n (3 To copute A, we can assign to each negative eaple above the threshold a position based on its classification rank. Let position one be the first position above the threshold and let α 1 <... < α denote the positions in increasing order of the negative eaples in the region above the threshold. The total nuber of eaples classified as positive is N (k +. Thus, by definition of A, A (N α i ( i (4 i1 where the first ter N α i represents the nuber of eaples ranked higher than the ith eaple and the second ter i discounts the nuber of negative eaples incorrectly ranked higher than the ith eaple. Siilarly, let α 1 <... < α k denote the positions of the k positive eaples below the threshold, counting positions in reverse by starting fro the threshold. Then, A 3 is given by: A 3 (N α j ( j (5 j1 with N n + (k and k. Cobining the epressions of A 1, A, and A 3 leads to: A A 1 + A + A 3 n 1 + (k + k n ( i1 α i + j1 α j n (6
4 Lea For a fied, the average value of the AUC A is given by: Proof. < A > 1 n + k The proof is based on the coputation of the average values of i1 α i and j1 α j for a given. We start by coputing the average value < α i > for a given i, 1 i. Consider all the possible positions for α 1... α i 1 and α i+1... α, when the value of α i is fied at say α i l. We have i l N ( i since there need to be at least i 1 positions before α i and N ( i above. There are l 1 possible positions for α 1... α i 1 and N l possible positions for α i+1... α. Since the total nuber of ways of choosing the positions for α 1... α out of N is, the average value < αi > is: N ( i li l ( ( l 1 N l i 1 i < α i > (8 Thus, < N ( i i1 li l ( ( l 1 N l N i 1 i l1 α i > l ( l 1 l i1 i 1 i (9 i1 Using the classical identity: ( u ( v ( p 1+p p p 1 p u+v p, we can write: N l1 < α i > l( ( N 1 N 1 1 N(N (N + 1 i1 Siilarly, we have: < α j > (N + 1 j1 Replacing < i1 α i > and < j1 α j > in Eq. (6 by the epressions given by Eq. (10 and Eq. (11 leads to: < A > 1 + (k + k (N + 1 (N n which ends the proof of the lea. n + k Note that Eq. (7 shows that the average AUC value for a given is siply one inus the average of the accuracy rates for the positive and negative classes. Proposition 1 Assue that a binary classification task with positive eaples and n negative eaples is given. Then, the epected value of the AUC A over all classifications with k errors is given by: < A > 1 k + n (n ( + n + 1 4n ( k + n k 1 ( +n 0 k 0 ( +n+1 Proof. Lea gives the average value of the AUC for a fied value of. To copute the average over all possible values of, we need to weight the epression of Eq. (7 with the total nuber of possible classifications for a given. There are possible ways of choosing the positions of the isclassified negative eaples, and siilarly ( N possible ways of choosing the positions of the k isclassified positive eaples. Thus, in view of Lea, the average AUC is given by: < A > N ( (1 k 0 k 0 n + k (7 (10 (11 (1 (13 (14
5 Mean value of the AUC r0.05 r0.01 r0.1 r0.5 r Error rate Relative standard deviation r0.01 r0.05 r0.1 r Error rate r0.5 Figure 3: Mean (left and relative standard deviation (right of the AUC as a function of the error rate. Each curve corresponds to a fied ratio of r n/(n +. The average AUC value onotonically increases with the accuracy. For n, as for the top curve in the left plot, the average AUC coincides with the accuracy. The standard deviation decreases with the accuracy, and the lowest curve corresponds to n. This epression can be siplified into Eq. (13 3 using the following novel identities:!!! kx N N kx n !!! kx N N kx (k ( n + k n (15 (16 that we obtained by using Zeilberger s algorith 4 and nuerous cobinatorial tricks. Fro the epression of Eq. (13, it is clear that the average AUC value is identical to the accuracy of the classifier only for even distributions (n. For n, the epected value of the AUC is a onotonic function of the accuracy, see Fig. (3(left. For a fied ratio of n/(n +, the curves are obtained by increasing the accuracy fro n/(n + to 1. The average AUC varies onotonically in the range of accuracy between 0.5 and 1.0. In other words, on average, there sees nothing to be gained in designing specific learning algoriths for aiizing the AUC: a classification algorith iniizing the error rate also optiizes the AUC. However, this only holds for the average AUC. Indeed, we will show in the net section that the variance of the AUC value is not null for any ratio n/(n + when k 0. 4 The Variance of the AUC Let D n + (k +k, a i1 α i, a j1 α j, and α a + a. Then, by Eq. (6, na D α. Thus, the variance of the AUC, σ (A, is given by: (n σ (A < (D α (< D > < α > > (17 < D > < D > + < α > < α > (< αd > < α >< D > As before, to copute the average of a ter X over all classifications, we can first deterine its average < X > for a fied, and then use the function F defined by: k N 0 F(Y ( Y k N (18 0 ( and < X > F(< X >. A crucial step in coputing the eact value of the variance of the AUC is to deterine the value of the ters of the type < a > < ( i1 α i >. 3 An essential difference between Eq. (14 and the epression given by [15] is the weighting by the nuber of configurations. The authors analysis leads the to the conclusion that the average AUC is identical to the accuracy for all ratios n/(n +, which is false. 4 We thank Neil Sloane for having pointed us to Zeilberger s algorith and Maple package.
6 Lea 3 For a fied, the average of ( i1 α i is given by: < a (N + 1 > (3N + + N (19 1 Proof. By definition of a, < a > b + c with: b < α i > c < i1 1 i<j Reasoning as in the proof of Lea, we can obtain: N ( i i1 li l ( ( l 1 N l N 1 i 1 i b l 1 l1 α i α j > (0 (N + 1(N To copute c, we start by coputing the average value of < α i α j >, for a given pair (i, j with i < j. As in the proof of Lea, consider all the possible positions of α 1... α i 1, α i+1...α j 1, and α j+1... α when α i is fied at α i l, and α j is fied at α j l. There are l 1 possible positions for the α 1... α i 1, l l 1 possible positions for α i+1...α j 1, and N l possible positions for α j+1... α. Thus, we have: i l<l < α i α j > N ( j ll ( ( l 1 l ( l 1 N l i 1 j i 1 j ( (1 and c ( l 1 ( l ( l<l ll l 1 N l ( N (3 3 Using the identity ( l 1 ( l ( l 1 N l ( N, we obtain: (N + 1(3N + ( 1 c 4 Cobining Eq. (1 and Eq. (4 leads to Eq. (19. Proposition Assue that a binary classification task with positive eaples and n negative eaples is given. Then, the variance of the AUC A over all classifications with k errors is given by: σ (A F((1 n + k F((1 n + k (4 + (5 F( + n(k + (( n(n + 1(k (k ( + n n Proof. Eq. (18 can be developed and epressed in ters of F, D, a, and a : (n σ (A F([D < a + a > ] F(D < a + a > + F(< a > < a > + F(< a > < a > (6 The epressions for < a > and < a > were given in the proof of Lea, and that of < a > by Lea 3. The following forula can be obtained in a siilar way: < a > (N +1 1 (3N + + N. Replacing these epressions in Eq. (6 and further siplifications give eactly Eq. (5 and prove the proposition. The epression of the variance is illustrated by Fig. (3(right which shows the value of one standard deviation of the AUC divided by the corresponding ean value of the AUC. This figure is parallel to the one showing the ean of the AUC (Fig. (3(left. Each line is obtained by fiing the ratio n/(n + and varying the nuber of errors fro 1 to the size of the sallest class. The ore uneven class distributions have the highest variance, the variance increases with the nuber of errors. These observations contradict the ineact clai of [15] that the variance is zero for all error rates with even distributions n. In Fig. (3(right, the even distribution n corresponds to the lowest dashed line.
7 n Dataset Size # of n+ AUCsplit[4] RankBoost Attr. (% Accuracy (% AUC (% Accuracy (% AUC (% Breast-Wpbc ± ± ± ± 8.0 Credit ± ±.9 Ionosphere ± ± ± ± 3.3 Pia ± ± ± ± 6.5 SPECTF Page-blocks ± ± ± ± 1.5 Yeast (CYT ± ± ± ± 3.0 Table 1: Accuracy and AUC values for several datasets fro the UC Irvine repository. The values for RankBoost are obtained by 10-fold cross-validation. The values for AUCsplit are fro [4]. 5 Eperiental Results Proposition above deonstrates that, for uneven distributions, classifiers with the sae fied (low accuracy ehibit noticeably different AUC values. This otivates the use of algoriths directly optiizing the AUC rather than doing so indirectly via iniizing the error rate. Under certain conditions, RankBoost [5] can be viewed eactly as an algorith optiizing the AUC. In this section, we ake the connection between RankBoost and AUC optiization, and copare the perforance of RankBoost to two recent algoriths proposed for optiizing an approiation [15] or locally optiizing the AUC [4]. The objective of RankBoost is to produce a ranking that iniizes the nuber of incorrectly ordered pairs of eaples, possibly with different costs assigned to the is-rankings. When the eaples to be ranked are siply two disjoint sets, the objective function iniized by RankBoost is n 1 1 rloss n 1 i y j (7 i1 j1 which is eactly one inus the Wilcoon-Mann-Whitney statistic. Thus, by Lea 1, the objective function aiized by RankBoost coincides with the AUC. RankBoost s optiization is based on cobining a nuber of weak rankings. For our eperients, we chose as weak rankings threshold rankers with the range {0, 1}, siilar to the boosted stups often used by AdaBoost [6]. We used the so-called Third Method of RankBoost for selecting the best weak ranker. According to this ethod, at each step, the weak threshold ranker is selected so as to aiize the AUC of the weighted distribution. Thus, with this ethod, the global objective of obtaining the best AUC is obtained by selecting the weak ranking with the best AUC at each step. Furtherore, the RankBoost algorith aintains a perfect 50-50% distribution of the weights on the positive and negative eaples. By Proposition 1, for even distributions, the ean of the AUC is identical to the classification accuracy. For threshold rankers like step functions, or stups, there is no variance of the AUC, so the ean of the AUC is equal to the observed AUC. That is, instead of viewing RankBoost as selecting the weak ranker with the best weighted AUC value, one can view it as selecting the weak ranker with the lowest weighted error rate. This is siilar to the choice of the best weak learner for boosted stups in AdaBoost. So, for stups, AdaBoost and RankBoost differ only in the updating schee of the weights: RankBoost updates the positive eaples differently fro the negative ones, while AdaBoost uses one coon schee for the two groups. Our eperiental results corroborate the observation that RankBoost is an algorith optiizing the AUC. RankBoost based on boosted stups obtains AUC values that are substantially better than those reported in the literature for algoriths designed to locally or approiately optiize the AUC. Table 1 copares the results of RankBoost on a nuber of datasets fro the UC Irvine repository to the results reported by [4]. The results for RankBoost are obtained by 10-fold cross-validation. For RankBoost, the accuracy and the best AUC values reported on each line of the table correspond to the sae boosting step. RankBoost consistently outperfors AUCsplit in a coparison based on AUC values, even for the datasets such as Breast-Wpbc and Pia where the two algoriths obtain siilar accuracies. The table also lists results for the UC Irvine Credit Approval and SPECTF heart dataset, for which the authors of [15] report results corresponding to their AUC optiization algoriths. The AUC values reported by [15] are no better than 9.5% for the Credit
8 Approval dataset and only 87.5% for the SPECTF dataset, which is substantially lower. Fro the table, it is also clear that RankBoost is not an error rate iniization algorith. The accuracy for the Yeast (CYT dataset is as low as 45%. 6 Conclusion A statistical analysis of the relationship between the AUC value and the error rate was given, including the first eact epression of the epected value and standard deviation of the AUC for a fied error rate. The results offer a better understanding of the effect on the AUC value of algoriths designed for error rate iniization. For uneven distributions and relatively high error rates, the standard deviation of the AUC suggests that algoriths designed to optiize the AUC value ay lead to substantially better AUC values. Our eperiental results using RankBoost corroborate this clai. In separate eperients we have observed that AdaBoost achieves significantly better error rates than RankBoost (as epected but that it also leads to AUC values close to those achieved by RankBoost. It is a topic for further study to eplain and understand this property of AdaBoost. A partial eplanation could be that, just like RankBoost, AdaBoost aintains at each boosting round an equal distribution of the weights for positive and negative eaples. References [1] L. Breian, J. H. Friedan, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth International, Belont, CA, [] J-H. Chauchat, R. Rakotoalala, M. Carloz, and C. Pelletier. Targeting custoer groups using gain and cost atri; a arketing application. Technical report, ERIC Laboratory - University of Lyon, 001. [3] J. P. Egan. Signal Detection Theory and ROC Analysis. Acadeic Press, [4] C. Ferri, P. Flach, and J. Hernández-Orallo. Learning decision trees using the area under the ROC curve. In ICML-00. Morgan Kaufann, 00. [5] Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorith for cobining preferences. In ICML-98. Morgan Kaufann, San Francisco, US, [6] Yoav Freund and Robert E. Schapire. A decision theoretical generalization of online learning and an application to boosting. In Proceedings of the Second European Conference on Coputational Learning Theory, volue, [7] D. M. Green and J. A Swets. Signal detection theory and psychophysics. New York: Wiley, [8] J. A. Hanley and B. J. McNeil. The eaning and use of the area under a receiver operating characteristic (ROC curve. Radiology, 198. [9] M. C. Mozer, R. Dodier, M. D. Colagrosso, C. Guerra-Salcedo, and R. Wolniewicz. Prodding the ROC curve. In NIPS-00. MIT Press, 00. [10] C. Perlich, F. Provost, and J. Sionoff. Tree induction vs. logistic regression: A learning curve analysis. Journal of Machine Learning Research, 003. [11] G. Piatetsky-Shapiro and S. Steingold. Measuring lift quality in database arketing. In SIGKDD Eplorations. ACM SIGKDD, 000. [1] F. Provost and T. Fawcett. Analysis and visualization of classifier perforance: Coparison under iprecise class and cost distribution. In KDD-97. AAAI, [13] S. Rosset. Ranking-ethods for fleible evaluation and efficient coparison of - class odels. Master s thesis, Tel-Aviv University, [14] S. Rosset, E. Neuann, U. Eick, N. Vatnik, and I. Idan. Evaluation of prediction odels for arketing capaigns. In KDD-001. ACM Press, 001. [15] L. Yan, R. Dodier, M. C. Mozer, and R. Wolniewicz. Optiizing Classifier Perforance Via the Wilcoon-Mann-Whitney Statistics. In ICML-003, 003.
Online Bagging and Boosting
Abstract Bagging and boosting are two of the ost well-known enseble learning ethods due to their theoretical perforance guarantees and strong experiental results. However, these algoriths have been used
More informationMulti-Class Deep Boosting
Multi-Class Deep Boosting Vitaly Kuznetsov Courant Institute 25 Mercer Street New York, NY 002 vitaly@cis.nyu.edu Mehryar Mohri Courant Institute & Google Research 25 Mercer Street New York, NY 002 ohri@cis.nyu.edu
More informationInternational Journal of Management & Information Systems First Quarter 2012 Volume 16, Number 1
International Journal of Manageent & Inforation Systes First Quarter 2012 Volue 16, Nuber 1 Proposal And Effectiveness Of A Highly Copelling Direct Mail Method - Establishent And Deployent Of PMOS-DM Hisatoshi
More informationCRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS
641 CRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS Marketa Zajarosova 1* *Ph.D. VSB - Technical University of Ostrava, THE CZECH REPUBLIC arketa.zajarosova@vsb.cz Abstract Custoer relationship
More informationPERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO
Bulletin of the Transilvania University of Braşov Series I: Engineering Sciences Vol. 4 (53) No. - 0 PERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO V. CAZACU I. SZÉKELY F. SANDU 3 T. BĂLAN Abstract:
More informationApplying Multiple Neural Networks on Large Scale Data
0 International Conference on Inforation and Electronics Engineering IPCSIT vol6 (0) (0) IACSIT Press, Singapore Applying Multiple Neural Networks on Large Scale Data Kritsanatt Boonkiatpong and Sukree
More informationExercise 4 INVESTIGATION OF THE ONE-DEGREE-OF-FREEDOM SYSTEM
Eercise 4 IVESTIGATIO OF THE OE-DEGREE-OF-FREEDOM SYSTEM 1. Ai of the eercise Identification of paraeters of the euation describing a one-degree-of- freedo (1 DOF) atheatical odel of the real vibrating
More informationExtended-Horizon Analysis of Pressure Sensitivities for Leak Detection in Water Distribution Networks: Application to the Barcelona Network
2013 European Control Conference (ECC) July 17-19, 2013, Zürich, Switzerland. Extended-Horizon Analysis of Pressure Sensitivities for Leak Detection in Water Distribution Networks: Application to the Barcelona
More informationPerformance Evaluation of Machine Learning Techniques using Software Cost Drivers
Perforance Evaluation of Machine Learning Techniques using Software Cost Drivers Manas Gaur Departent of Coputer Engineering, Delhi Technological University Delhi, India ABSTRACT There is a treendous rise
More informationHow To Get A Loan From A Bank For Free
Finance 111 Finance We have to work with oney every day. While balancing your checkbook or calculating your onthly expenditures on espresso requires only arithetic, when we start saving, planning for retireent,
More informationNon-Price Equilibria in Markets of Discrete Goods
Non-Price Equilibria in Markets of Discrete Goods (working paper) Avinatan Hassidi Hai Kaplan Yishay Mansour Noa Nisan ABSTRACT We study arkets of indivisible ites in which price-based (Walrasian) equilibria
More informationINTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE SYSTEMS
Artificial Intelligence Methods and Techniques for Business and Engineering Applications 210 INTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE
More informationGaussian Processes for Regression: A Quick Introduction
Gaussian Processes for Regression A Quick Introduction M Ebden, August 28 Coents to arkebden@engoacuk MOTIVATION Figure illustrates a typical eaple of a prediction proble given soe noisy observations of
More informationThis paper studies a rental firm that offers reusable products to price- and quality-of-service sensitive
MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol., No. 3, Suer 28, pp. 429 447 issn 523-464 eissn 526-5498 8 3 429 infors doi.287/so.7.8 28 INFORMS INFORMS holds copyright to this article and distributed
More informationUse of extrapolation to forecast the working capital in the mechanical engineering companies
ECONTECHMOD. AN INTERNATIONAL QUARTERLY JOURNAL 2014. Vol. 1. No. 1. 23 28 Use of extrapolation to forecast the working capital in the echanical engineering copanies A. Cherep, Y. Shvets Departent of finance
More informationPreference-based Search and Multi-criteria Optimization
Fro: AAAI-02 Proceedings. Copyright 2002, AAAI (www.aaai.org). All rights reserved. Preference-based Search and Multi-criteria Optiization Ulrich Junker ILOG 1681, route des Dolines F-06560 Valbonne ujunker@ilog.fr
More informationMachine Learning Applications in Grid Computing
Machine Learning Applications in Grid Coputing George Cybenko, Guofei Jiang and Daniel Bilar Thayer School of Engineering Dartouth College Hanover, NH 03755, USA gvc@dartouth.edu, guofei.jiang@dartouth.edu
More informationEvaluating Inventory Management Performance: a Preliminary Desk-Simulation Study Based on IOC Model
Evaluating Inventory Manageent Perforance: a Preliinary Desk-Siulation Study Based on IOC Model Flora Bernardel, Roberto Panizzolo, and Davide Martinazzo Abstract The focus of this study is on preliinary
More informationAn Integrated Approach for Monitoring Service Level Parameters of Software-Defined Networking
International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15), pp. 197-4 http://d.doi.org/1.1457/ijfgcn.15.8.6.19 An Integrated Approach for Monitoring Service Level Paraeters
More informationResearch Article Performance Evaluation of Human Resource Outsourcing in Food Processing Enterprises
Advance Journal of Food Science and Technology 9(2): 964-969, 205 ISSN: 2042-4868; e-issn: 2042-4876 205 Maxwell Scientific Publication Corp. Subitted: August 0, 205 Accepted: Septeber 3, 205 Published:
More informationCLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY
CLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY Y. T. Chen Departent of Industrial and Systes Engineering Hong Kong Polytechnic University, Hong Kong yongtong.chen@connect.polyu.hk
More informationOnline Appendix I: A Model of Household Bargaining with Violence. In this appendix I develop a simple model of household bargaining that
Online Appendix I: A Model of Household Bargaining ith Violence In this appendix I develop a siple odel of household bargaining that incorporates violence and shos under hat assuptions an increase in oen
More informationarxiv:0805.1434v1 [math.pr] 9 May 2008
Degree-distribution stability of scale-free networs Zhenting Hou, Xiangxing Kong, Dinghua Shi,2, and Guanrong Chen 3 School of Matheatics, Central South University, Changsha 40083, China 2 Departent of
More informationSearching strategy for multi-target discovery in wireless networks
Searching strategy for ulti-target discovery in wireless networks Zhao Cheng, Wendi B. Heinzelan Departent of Electrical and Coputer Engineering University of Rochester Rochester, NY 467 (585) 75-{878,
More informationMarkovian inventory policy with application to the paper industry
Coputers and Cheical Engineering 26 (2002) 1399 1413 www.elsevier.co/locate/copcheeng Markovian inventory policy with application to the paper industry K. Karen Yin a, *, Hu Liu a,1, Neil E. Johnson b,2
More informationMethod of supply chain optimization in E-commerce
MPRA Munich Personal RePEc Archive Method of supply chain optiization in E-coerce Petr Suchánek and Robert Bucki Silesian University - School of Business Adinistration, The College of Inforatics and Manageent
More informationHalloween Costume Ideas for the Wii Game
Algorithica 2001) 30: 101 139 DOI: 101007/s00453-001-0003-0 Algorithica 2001 Springer-Verlag New York Inc Optial Search and One-Way Trading Online Algoriths R El-Yaniv, 1 A Fiat, 2 R M Karp, 3 and G Turpin
More informationAirline Yield Management with Overbooking, Cancellations, and No-Shows JANAKIRAM SUBRAMANIAN
Airline Yield Manageent with Overbooking, Cancellations, and No-Shows JANAKIRAM SUBRAMANIAN Integral Developent Corporation, 301 University Avenue, Suite 200, Palo Alto, California 94301 SHALER STIDHAM
More informationThe Research of Measuring Approach and Energy Efficiency for Hadoop Periodic Jobs
Send Orders for Reprints to reprints@benthascience.ae 206 The Open Fuels & Energy Science Journal, 2015, 8, 206-210 Open Access The Research of Measuring Approach and Energy Efficiency for Hadoop Periodic
More information( C) CLASS 10. TEMPERATURE AND ATOMS
CLASS 10. EMPERAURE AND AOMS 10.1. INRODUCION Boyle s understanding of the pressure-volue relationship for gases occurred in the late 1600 s. he relationships between volue and teperature, and between
More informationData Set Generation for Rectangular Placement Problems
Data Set Generation for Rectangular Placeent Probles Christine L. Valenzuela (Muford) Pearl Y. Wang School of Coputer Science & Inforatics Departent of Coputer Science MS 4A5 Cardiff University George
More informationProject Evaluation Roadmap. Capital Budgeting Process. Capital Expenditure. Major Cash Flow Components. Cash Flows... COMM2501 Financial Management
COMM501 Financial Manageent Project Evaluation 1 (Capital Budgeting) Project Evaluation Roadap COMM501 Financial Manageent Week 7 Week 7 Project dependencies Net present value ethod Relevant cash flows
More informationData Streaming Algorithms for Estimating Entropy of Network Traffic
Data Streaing Algoriths for Estiating Entropy of Network Traffic Ashwin Lall University of Rochester Vyas Sekar Carnegie Mellon University Mitsunori Ogihara University of Rochester Jun (Ji) Xu Georgia
More information2. FINDING A SOLUTION
The 7 th Balan Conference on Operational Research BACOR 5 Constanta, May 5, Roania OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS
More informationA framework for performance monitoring, load balancing, adaptive timeouts and quality of service in digital libraries
Int J Digit Libr (2000) 3: 9 35 INTERNATIONAL JOURNAL ON Digital Libraries Springer-Verlag 2000 A fraework for perforance onitoring, load balancing, adaptive tieouts and quality of service in digital libraries
More informationPricing Asian Options using Monte Carlo Methods
U.U.D.M. Project Report 9:7 Pricing Asian Options using Monte Carlo Methods Hongbin Zhang Exaensarbete i ateatik, 3 hp Handledare och exainator: Johan Tysk Juni 9 Departent of Matheatics Uppsala University
More informationPosition Auctions and Non-uniform Conversion Rates
Position Auctions and Non-unifor Conversion Rates Liad Blurosen Microsoft Research Mountain View, CA 944 liadbl@icrosoft.co Jason D. Hartline Shuzhen Nong Electrical Engineering and Microsoft AdCenter
More informationExploiting Hardware Heterogeneity within the Same Instance Type of Amazon EC2
Exploiting Hardware Heterogeneity within the Sae Instance Type of Aazon EC2 Zhonghong Ou, Hao Zhuang, Jukka K. Nurinen, Antti Ylä-Jääski, Pan Hui Aalto University, Finland; Deutsch Teleko Laboratories,
More informationComment on On Discriminative vs. Generative Classifiers: A Comparison of Logistic Regression and Naive Bayes
Coent on On Discriinative vs. Generative Classifiers: A Coparison of Logistic Regression and Naive Bayes Jing-Hao Xue (jinghao@stats.gla.ac.uk) and D. Michael Titterington (ike@stats.gla.ac.uk) Departent
More informationAn Innovate Dynamic Load Balancing Algorithm Based on Task
An Innovate Dynaic Load Balancing Algorith Based on Task Classification Hong-bin Wang,,a, Zhi-yi Fang, b, Guan-nan Qu,*,c, Xiao-dan Ren,d College of Coputer Science and Technology, Jilin University, Changchun
More information- 265 - Part C. Property and Casualty Insurance Companies
Part C. Property and Casualty Insurance Copanies This Part discusses proposals to curtail favorable tax rules for property and casualty ("P&C") insurance copanies. The syste of reserves for unpaid losses
More informationSAMPLING METHODS LEARNING OBJECTIVES
6 SAMPLING METHODS 6 Using Statistics 6-6 2 Nonprobability Sapling and Bias 6-6 Stratified Rando Sapling 6-2 6 4 Cluster Sapling 6-4 6 5 Systeatic Sapling 6-9 6 6 Nonresponse 6-2 6 7 Suary and Review of
More informationON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128
ON SELF-ROUTING IN CLOS CONNECTION NETWORKS BARRY G. DOUGLASS Electrical Engineering Departent Texas A&M University College Station, TX 778-8 A. YAVUZ ORUÇ Electrical Engineering Departent and Institute
More informationReliability Constrained Packet-sizing for Linear Multi-hop Wireless Networks
Reliability Constrained acket-sizing for inear Multi-hop Wireless Networks Ning Wen, and Randall A. Berry Departent of Electrical Engineering and Coputer Science Northwestern University, Evanston, Illinois
More informationA quantum secret ballot. Abstract
A quantu secret ballot Shahar Dolev and Itaar Pitowsky The Edelstein Center, Levi Building, The Hebrerw University, Givat Ra, Jerusale, Israel Boaz Tair arxiv:quant-ph/060087v 8 Mar 006 Departent of Philosophy
More informationFuzzy Sets in HR Management
Acta Polytechnica Hungarica Vol. 8, No. 3, 2011 Fuzzy Sets in HR Manageent Blanka Zeková AXIOM SW, s.r.o., 760 01 Zlín, Czech Republic blanka.zekova@sezna.cz Jana Talašová Faculty of Science, Palacký Univerzity,
More informationQuality evaluation of the model-based forecasts of implied volatility index
Quality evaluation of the odel-based forecasts of iplied volatility index Katarzyna Łęczycka 1 Abstract Influence of volatility on financial arket forecasts is very high. It appears as a specific factor
More informationVectors & Newton's Laws I
Physics 6 Vectors & Newton's Laws I Introduction In this laboratory you will eplore a few aspects of Newton s Laws ug a force table in Part I and in Part II, force sensors and DataStudio. By establishing
More informationSoftware Quality Characteristics Tested For Mobile Application Development
Thesis no: MGSE-2015-02 Software Quality Characteristics Tested For Mobile Application Developent Literature Review and Epirical Survey WALEED ANWAR Faculty of Coputing Blekinge Institute of Technology
More informationEvaluating Software Quality of Vendors using Fuzzy Analytic Hierarchy Process
IMECS 2008 9-2 March 2008 Hong Kong Evaluating Software Quality of Vendors using Fuzzy Analytic Hierarchy Process Kevin K.F. Yuen* Henry C.W. au Abstract This paper proposes a fuzzy Analytic Hierarchy
More informationThe AGA Evaluating Model of Customer Loyalty Based on E-commerce Environment
6 JOURNAL OF SOFTWARE, VOL. 4, NO. 3, MAY 009 The AGA Evaluating Model of Custoer Loyalty Based on E-coerce Environent Shaoei Yang Econoics and Manageent Departent, North China Electric Power University,
More informationAN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES
Int. J. Appl. Math. Coput. Sci., 2014, Vol. 24, No. 1, 133 149 DOI: 10.2478/acs-2014-0011 AN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES PIOTR KULCZYCKI,,
More informationConstruction Economics & Finance. Module 3 Lecture-1
Depreciation:- Construction Econoics & Finance Module 3 Lecture- It represents the reduction in arket value of an asset due to age, wear and tear and obsolescence. The physical deterioration of the asset
More informationInformation Processing Letters
Inforation Processing Letters 111 2011) 178 183 Contents lists available at ScienceDirect Inforation Processing Letters www.elsevier.co/locate/ipl Offline file assignents for online load balancing Paul
More informationAn improved TF-IDF approach for text classification *
Zhang et al. / J Zheiang Univ SCI 2005 6A(1:49-55 49 Journal of Zheiang University SCIECE ISS 1009-3095 http://www.zu.edu.cn/zus E-ail: zus@zu.edu.cn An iproved TF-IDF approach for text classification
More informationADJUSTING FOR QUALITY CHANGE
ADJUSTING FOR QUALITY CHANGE 7 Introduction 7.1 The easureent of changes in the level of consuer prices is coplicated by the appearance and disappearance of new and old goods and services, as well as changes
More informationImage restoration for a rectangular poor-pixels detector
Iage restoration for a rectangular poor-pixels detector Pengcheng Wen 1, Xiangjun Wang 1, Hong Wei 2 1 State Key Laboratory of Precision Measuring Technology and Instruents, Tianjin University, China 2
More informationAn Approach to Combating Free-riding in Peer-to-Peer Networks
An Approach to Cobating Free-riding in Peer-to-Peer Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 April 7, 2008
More informationMedia Adaptation Framework in Biofeedback System for Stroke Patient Rehabilitation
Media Adaptation Fraework in Biofeedback Syste for Stroke Patient Rehabilitation Yinpeng Chen, Weiwei Xu, Hari Sundara, Thanassis Rikakis, Sheng-Min Liu Arts, Media and Engineering Progra Arizona State
More informationInvesting in corporate bonds?
Investing in corporate bonds? This independent guide fro the Australian Securities and Investents Coission (ASIC) can help you look past the return and assess the risks of corporate bonds. If you re thinking
More informationPhysics 211: Lab Oscillations. Simple Harmonic Motion.
Physics 11: Lab Oscillations. Siple Haronic Motion. Reading Assignent: Chapter 15 Introduction: As we learned in class, physical systes will undergo an oscillatory otion, when displaced fro a stable equilibriu.
More informationEfficient Key Management for Secure Group Communications with Bursty Behavior
Efficient Key Manageent for Secure Group Counications with Bursty Behavior Xukai Zou, Byrav Raaurthy Departent of Coputer Science and Engineering University of Nebraska-Lincoln Lincoln, NE68588, USA Eail:
More informationReal Time Target Tracking with Binary Sensor Networks and Parallel Computing
Real Tie Target Tracking with Binary Sensor Networks and Parallel Coputing Hong Lin, John Rushing, Sara J. Graves, Steve Tanner, and Evans Criswell Abstract A parallel real tie data fusion and target tracking
More informationStandards and Protocols for the Collection and Dissemination of Graduating Student Initial Career Outcomes Information For Undergraduates
National Association of Colleges and Eployers Standards and Protocols for the Collection and Disseination of Graduating Student Initial Career Outcoes Inforation For Undergraduates Developed by the NACE
More informationEnergy Proportionality for Disk Storage Using Replication
Energy Proportionality for Disk Storage Using Replication Jinoh Ki and Doron Rote Lawrence Berkeley National Laboratory University of California, Berkeley, CA 94720 {jinohki,d rote}@lbl.gov Abstract Energy
More informationMINIMUM VERTEX DEGREE THRESHOLD FOR LOOSE HAMILTON CYCLES IN 3-UNIFORM HYPERGRAPHS
MINIMUM VERTEX DEGREE THRESHOLD FOR LOOSE HAMILTON CYCLES IN 3-UNIFORM HYPERGRAPHS JIE HAN AND YI ZHAO Abstract. We show that for sufficiently large n, every 3-unifor hypergraph on n vertices with iniu
More informationOn Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
On Coputing Nearest Neighbors with Applications to Decoding of Binary Linear Codes Alexander May and Ilya Ozerov Horst Görtz Institute for IT-Security Ruhr-University Bochu, Gerany Faculty of Matheatics
More information6. Time (or Space) Series Analysis
ATM 55 otes: Tie Series Analysis - Section 6a Page 8 6. Tie (or Space) Series Analysis In this chapter we will consider soe coon aspects of tie series analysis including autocorrelation, statistical prediction,
More informationReconnect 04 Solving Integer Programs with Branch and Bound (and Branch and Cut)
Sandia is a ultiprogra laboratory operated by Sandia Corporation, a Lockheed Martin Copany, Reconnect 04 Solving Integer Progras with Branch and Bound (and Branch and Cut) Cynthia Phillips (Sandia National
More informationFactored Models for Probabilistic Modal Logic
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008 Factored Models for Probabilistic Modal Logic Afsaneh Shirazi and Eyal Air Coputer Science Departent, University of Illinois
More informationSUPPORTING YOUR HIPAA COMPLIANCE EFFORTS
WHITE PAPER SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS Quanti Solutions. Advancing HIM through Innovation HEALTHCARE SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS Quanti Solutions. Advancing HIM through Innovation
More informationInvesting in corporate bonds?
Investing in corporate bonds? This independent guide fro the Australian Securities and Investents Coission (ASIC) can help you look past the return and assess the risks of corporate bonds. If you re thinking
More informationEnergy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and migration algorithms
Energy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and igration algoriths Chaia Ghribi, Makhlouf Hadji and Djaal Zeghlache Institut Mines-Téléco, Téléco SudParis UMR CNRS 5157 9, Rue
More informationOpenGamma Documentation Bond Pricing
OpenGaa Docuentation Bond Pricing Marc Henrard arc@opengaa.co OpenGaa Docuentation n. 5 Version 2.0 - May 2013 Abstract The details of the ipleentation of pricing for fixed coupon bonds and floating rate
More informationFuzzy Evaluation on Network Security Based on the New Algorithm of Membership Degree Transformation M(1,2,3)
324 JOURNAL OF NETWORKS, VOL. 4, NO. 5, JULY 29 Fuzzy Evaluation on Networ Security Based on the New Algorith of Mebership Degree Transforation M(,2,3) Hua Jiang School of Econoics and Manageent, Hebei
More informationMarkov Models and Their Use for Calculations of Important Traffic Parameters of Contact Center
Markov Models and Their Use for Calculations of Iportant Traffic Paraeters of Contact Center ERIK CHROMY, JAN DIEZKA, MATEJ KAVACKY Institute of Telecounications Slovak University of Technology Bratislava
More informationAudio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA
Audio Engineering Society Convention Paper Presented at the 119th Convention 2005 October 7 10 New York, New York USA This convention paper has been reproduced fro the authors advance anuscript, without
More informationEntity Search Engine: Towards Agile Best-Effort Information Integration over the Web
Entity Search Engine: Towards Agile Best-Effort Inforation Integration over the Web Tao Cheng, Kevin Chen-Chuan Chang University of Illinois at Urbana-Chapaign {tcheng3, kcchang}@cs.uiuc.edu. INTRODUCTION
More informationKinetic Molecular Theory of Ideal Gases
ecture /. Kinetic olecular Theory of Ideal Gases ast ecture. IG is a purely epirical law - solely the consequence of eperiental obserations Eplains the behaior of gases oer a liited range of conditions.
More informationAdaptive Modulation and Coding for Unmanned Aerial Vehicle (UAV) Radio Channel
Recent Advances in Counications Adaptive odulation and Coding for Unanned Aerial Vehicle (UAV) Radio Channel Airhossein Fereidountabar,Gian Carlo Cardarilli, Rocco Fazzolari,Luca Di Nunzio Abstract In
More informationFUTURE LIFE-TABLES BASED ON THE LEE-CARTER METHODOLOGY AND THEIR APPLICATION TO CALCULATING THE PENSION ANNUITIES 1
ACA UNIVERSIAIS LODZIENSIS FOLIA OECONOMICA 250, 20 Agnieszka Rossa * FUURE LIFE-ABLES BASED ON HE LEE-CARER MEHODOLOGY AND HEIR APPLICAION O CALCULAING HE PENSION ANNUIIES Suary. In the paper a new recursie
More informationModeling Cooperative Gene Regulation Using Fast Orthogonal Search
8 The Open Bioinforatics Journal, 28, 2, 8-89 Open Access odeling Cooperative Gene Regulation Using Fast Orthogonal Search Ian inz* and ichael J. Korenberg* Departent of Electrical and Coputer Engineering,
More informationThe Relationship Between Precision-Recall and ROC Curves
Jesse Davis jdavis@cs.wisc.edu Mark Goadrich richm@cs.wisc.edu Department of Computer Sciences and Department of Biostatistics and Medical Informatics, University of Wisconsin-Madison, 2 West Dayton Street,
More informationMeasuring Lift Quality in Database Marketing
Measuring Lift Quality in Database Marketing Gregory Piatetsky-Shapiro Xchange Inc. One Lincoln Plaza, 89 South Street Boston, MA 2111 gps@xchange.com Sam Steingold Xchange Inc. One Lincoln Plaza, 89 South
More informationASIC Design Project Management Supported by Multi Agent Simulation
ASIC Design Project Manageent Supported by Multi Agent Siulation Jana Blaschke, Christian Sebeke, Wolfgang Rosenstiel Abstract The coplexity of Application Specific Integrated Circuits (ASICs) is continuously
More informationStable Learning in Coding Space for Multi-Class Decoding and Its Extension for Multi-Class Hypothesis Transfer Learning
Stable Learning in Coding Space for Multi-Class Decoding and Its Extension for Multi-Class Hypothesis Transfer Learning Bang Zhang, Yi Wang 2, Yang Wang, Fang Chen 2 National ICT Australia 2 School of
More informationESTIMATING LIQUIDITY PREMIA IN THE SPANISH GOVERNMENT SECURITIES MARKET
ESTIMATING LIQUIDITY PREMIA IN THE SPANISH GOVERNMENT SECURITIES MARKET Francisco Alonso, Roberto Blanco, Ana del Río and Alicia Sanchis Banco de España Banco de España Servicio de Estudios Docuento de
More informationDesign of Model Reference Self Tuning Mechanism for PID like Fuzzy Controller
Research Article International Journal of Current Engineering and Technology EISSN 77 46, PISSN 347 56 4 INPRESSCO, All Rights Reserved Available at http://inpressco.co/category/ijcet Design of Model Reference
More informationRECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION. Henrik Kure
RECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION Henrik Kure Dina, Danish Inforatics Network In the Agricultural Sciences Royal Veterinary and Agricultural University
More informationOn the effect of data set size on bias and variance in classification learning
On the effect of data set size on bias and variance in classification learning Abstract Damien Brain Geoffrey I Webb School of Computing and Mathematics Deakin University Geelong Vic 3217 With the advent
More informationAn Optimal Task Allocation Model for System Cost Analysis in Heterogeneous Distributed Computing Systems: A Heuristic Approach
An Optial Tas Allocation Model for Syste Cost Analysis in Heterogeneous Distributed Coputing Systes: A Heuristic Approach P. K. Yadav Central Building Research Institute, Rooree- 247667, Uttarahand (INDIA)
More informationPartitioned Elias-Fano Indexes
Partitioned Elias-ano Indexes Giuseppe Ottaviano ISTI-CNR, Pisa giuseppe.ottaviano@isti.cnr.it Rossano Venturini Dept. of Coputer Science, University of Pisa rossano@di.unipi.it ABSTRACT The Elias-ano
More informationOnline Community Detection for Large Complex Networks
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Online Counity Detection for Large Coplex Networks Wangsheng Zhang, Gang Pan, Zhaohui Wu, Shijian Li Departent
More informationPREDICTION OF MILKLINE FILL AND TRANSITION FROM STRATIFIED TO SLUG FLOW
PREDICTION OF MILKLINE FILL AND TRANSITION FROM STRATIFIED TO SLUG FLOW ABSTRACT: by Douglas J. Reineann, Ph.D. Assistant Professor of Agricultural Engineering and Graee A. Mein, Ph.D. Visiting Professor
More informationImplementation of Active Queue Management in a Combined Input and Output Queued Switch
pleentation of Active Queue Manageent in a obined nput and Output Queued Switch Bartek Wydrowski and Moshe Zukeran AR Special Research entre for Ultra-Broadband nforation Networks, EEE Departent, The University
More informationModel Combination. 24 Novembre 2009
Model Combination 24 Novembre 2009 Datamining 1 2009-2010 Plan 1 Principles of model combination 2 Resampling methods Bagging Random Forests Boosting 3 Hybrid methods Stacking Generic algorithm for mulistrategy
More informationA Study on the Chain Restaurants Dynamic Negotiation Games of the Optimization of Joint Procurement of Food Materials
International Journal of Coputer Science & Inforation Technology (IJCSIT) Vol 6, No 1, February 2014 A Study on the Chain estaurants Dynaic Negotiation aes of the Optiization of Joint Procureent of Food
More informationHow To Balance Over Redundant Wireless Sensor Networks Based On Diffluent
Load balancing over redundant wireless sensor networks based on diffluent Abstract Xikui Gao Yan ai Yun Ju School of Control and Coputer Engineering North China Electric ower University 02206 China Received
More informationA Scalable Application Placement Controller for Enterprise Data Centers
W WWW 7 / Track: Perforance and Scalability A Scalable Application Placeent Controller for Enterprise Data Centers Chunqiang Tang, Malgorzata Steinder, Michael Spreitzer, and Giovanni Pacifici IBM T.J.
More informationAutomatic Name-Face Alignment to Enable Cross-Media News Retrieval
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Autoatic ae-face Alignent to Enable Cross-Media ews Retrieval Yueie Zhang*, Wei Wu*, Yang Li*, Cheng Jin*, Xiangyang
More information