http://www.bibsonomy.org/burst/concept/tag/maximumBibSonomy BuRST Feed for /concept/tag/maximum2008-07-21T00:28:12+02:00http://www.bibsonomy.org/bibtex/29d5f4ab149a17ed9a8af2746ff126dfe/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00programming, maximum clique, conjecture, Keller hardness, graphs, complexity genetic algorithms, <span style="color:#555555;">Jamie <a href="http://www.bibsonomy.org/author/Marconi">Marconi</a> and James A. <a href="http://www.bibsonomy.org/author/Foster">Foster</a> </span><em>Proceedings of the 1998 IEEE World Congress on Computational Intelligence, </em><em>page650--655. </em><em>Anchorage, Alaska, USA, </em><em>IEEE Press, </em><em>5-9 May1998. </em>Thu Jun 19 17:35:00 CEST 2008Anchorage, Alaska, USAProceedings of the 1998 IEEE World Congress on Computational Intelligence5-9 May650--655A Hard Problem for Genetic Algorithms: Finding Cliques in Keller Graphs1998programming, maximum clique, conjecture, Keller hardness, graphs, complexity genetic algorithms, We present evidence that finding the maximum clique in Keller graphs is an example of a family of problems which are both natural and inherently difficult for genetic algorithms. Specifically, we employ a hybrid genetic algorithm to find the largest clique in Keller graphs. We present theoretical reasons why this problem is likely to be particularly hard for this family of graphs. Our results confirm this suspicion. We then discuss several characteristics of this graph family which confound genetic algorithms: its uniformity, edge density and small diameter.http://www.bibsonomy.org/bibtex/22896eb9538a6ee34f8e6c6757bdcf99e/jiljil2008-05-05T19:34:57+02:00deduction multinomial komplett mle map likelihood herleitung naive exhaustive prior thesis estimation bayes maximum <span style="color:#555555;">Jason D. M. <a href="http://www.bibsonomy.org/author/Rennie">Rennie</a> </span>(<em>2001</em>)Mon May 05 19:34:57 CEST 2008Improving Multi-class Text Classification with Naive Bayes2001deduction multinomial komplett mle map likelihood herleitung naive exhaustive prior thesis estimation bayes maximum There are numerous text documents available in electronic form. More and more are becoming available every day. Such documents represent a massive amount of information that is easily accessible. Seeking value in this huge collection requires organization; much of the work of organizing documents can be automated through text classification. The accuracy and our understanding of such systems greatly influences their usefulness. In this paper, we seek 1) to advance the understanding of commonly used text classification techniques, and 2) through that understanding, improve the tools that are available for text classification. We begin by clarifying the assumptions made in the derivation of Naive Bayes, noting basic properties and proposing ways for its extension and improvement. Next, we investigate the quality of Naive Bayes parameter estimates and their impact on classification. Our analysis leads to a theorem which gives an explanation for the improvements that can be found in multiclass classification with Naive Bayes using Error-Correcting Output Codes. We use experimental evidence on two commonly-used data sets to exhibit an application of the theorem. Finally, we show fundamental flaws in a commonly-used feature selection algorithm and develop a statistics-based framework for text feature selection. Greater understanding of Naive Bayes and the properties of text allows us to make better use of it in text classification.http://www.bibsonomy.org/bibtex/2cce318a1ed52b2765a4ab55584a8af16/smichasmicha2008-04-28T13:05:01+02:00entropy Maximum <span style="color:#555555;">Channing <a href="http://www.bibsonomy.org/author/Arndt">Arndt</a> and Sherman <a href="http://www.bibsonomy.org/author/Robinson">Robinson</a> and Finn <a href="http://www.bibsonomy.org/author/Tarp">Tarp</a> </span><em>Economic Modelling</em><em>19(3):375--398</em><em>May2002. </em>Mon Apr 28 13:05:01 CEST 2008Economic ModellingMay3375--398Parameter estimation for a computable general equilibrium model: a maximum entropy approach192002entropy Maximum http://www.bibsonomy.org/bibtex/23ac066804168c61e4b4c1986b4140f9d/smichasmicha2008-04-23T22:05:04+02:00Maximum bias <span style="color:#555555;">Jorge <a href="http://www.bibsonomy.org/author/Adrover">Adrover</a> and Ruben H. <a href="http://www.bibsonomy.org/author/Zamar">Zamar</a> </span><em>Journal of Statistical Planning and Inference</em><em>122(1-2):203--227</em><em>May2004. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceMay1-2203--227Bias robustness of three median-based regression estimates1222004Maximum bias 01http://www.bibsonomy.org/bibtex/2561cda0452f2cd50d4ece1fe609348fc/smichasmicha2008-04-23T22:05:04+02:00depth Maximum <span style="color:#555555;">Jorge G. <a href="http://www.bibsonomy.org/author/Adrover">Adrover</a> and Ricardo A. <a href="http://www.bibsonomy.org/author/Maronna">Maronna</a> and V'ictor J. <a href="http://www.bibsonomy.org/author/Yohai">Yohai</a> </span><em>Journal of Statistical Planning and Inference</em><em>105(2):363--375</em><em>Jul2002. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceJul2363--375Relationships between maximum depth and projection regression estimates1052002depth Maximum 01http://www.bibsonomy.org/bibtex/2de8fd9fb5c0d1036a1e210d645dae61d/smichasmicha2008-04-23T22:05:04+02:00likelihood spectrum Maximum <span style="color:#555555;">M. <a href="http://www.bibsonomy.org/author/Aktar">Aktar</a> and B. <a href="http://www.bibsonomy.org/author/Sankur">Sankur</a> and Y. <a href="http://www.bibsonomy.org/author/Istefanopulos">Istefanopulos</a> </span><em>Signal Processing</em><em>8(4):401--413</em><em>Jul1985. </em>Wed Apr 23 22:05:04 CEST 2008Signal ProcessingJul4401--413Properties of the maximum likelihood and pisarenko spectral estimates81985likelihood spectrum Maximum http://www.bibsonomy.org/bibtex/2003370dd92aa42863f5171a1fdd875ee/smichasmicha2008-04-23T22:05:04+02:00estimator likelihood Maximum <span style="color:#555555;">Jorge <a href="http://www.bibsonomy.org/author/Arag{\&#039;o}n">Arag'on</a> and David <a href="http://www.bibsonomy.org/author/Eberly">Eberly</a> and Shelly <a href="http://www.bibsonomy.org/author/Eberly">Eberly</a> </span><em>Statistics \&amp; Probability Letters</em><em>15(5):375--379</em><em>Dec1992. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersDec5375--379Existence and uniqueness of the maximum likelihood estimator for the two-parameter negative binomial distribution151992estimator likelihood Maximum 08http://www.bibsonomy.org/bibtex/291113bb01f245dbb7ada5931271c093f/smichasmicha2008-04-23T22:05:04+02:00maximum function likelihood <span style="color:#555555;">Philip J. <a href="http://www.bibsonomy.org/author/Boland">Boland</a> and Frank <a href="http://www.bibsonomy.org/author/Proschan">Proschan</a> </span><em>Statistics \&amp; Probability Letters</em><em>5(5):317--322</em><em>Aug1987. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersAug5317--322Schur convexity of the maximum likelihood function for the multivariate hypergeometric and multinomial distributions51987maximum function likelihood http://www.bibsonomy.org/bibtex/26d66506324f40b109476ca5e8657eb71/smichasmicha2008-04-23T22:05:04+02:00Maximum likelihood <span style="color:#555555;">M'onica F. <a href="http://www.bibsonomy.org/author/Bugallo">Bugallo</a> and Joaqu'in <a href="http://www.bibsonomy.org/author/M{\&#039;i}guez">M'iguez</a> and Luis <a href="http://www.bibsonomy.org/author/Castedo">Castedo</a> </span><em>Signal Processing</em><em>81(10):2041--2057</em><em>Oct2001. </em>Wed Apr 23 22:05:04 CEST 2008Signal ProcessingOct102041--2057Semiblind linear multiuser interference cancellation: a maximum likelihood approach812001Maximum likelihood http://www.bibsonomy.org/bibtex/2e56bd4f9cfc6d2932b2426da74deeaa3/smichasmicha2008-04-23T22:05:04+02:00likelihood Maximum <span style="color:#555555;">J. S. <a href="http://www.bibsonomy.org/author/Buzas">Buzas</a> and L. A. <a href="http://www.bibsonomy.org/author/Stefanski">Stefanski</a> </span><em>Journal of Statistical Planning and Inference</em><em>55(1):47--62</em><em>Oct1996. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceOct147--62Instrumental variable estimation in a probit measurement error model551996likelihood Maximum 15http://www.bibsonomy.org/bibtex/2c4fd97eb9c291a806bb45669913d9ffe/smichasmicha2008-04-23T22:05:04+02:00determinant Maximum <span style="color:#555555;">Theo <a href="http://www.bibsonomy.org/author/Chadjipantelis">Chadjipantelis</a> and Stratis <a href="http://www.bibsonomy.org/author/Kounias">Kounias</a> and Chronis <a href="http://www.bibsonomy.org/author/Moyssiadis">Moyssiadis</a> </span><em>Journal of Statistical Planning and Inference</em>(<em>1987</em>)Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and Inference167--178The maximum determinant of 21{\texttimes}21 (+1, -1)-matrices and d-optimal designs161987determinant Maximum http://www.bibsonomy.org/bibtex/2d8f75fb6c7536361b43222623d5b1cc3/smichasmicha2008-04-23T22:05:04+02:00Maximum likelihood <span style="color:#555555;">Djalil <a href="http://www.bibsonomy.org/author/ChafaI{\vs}">ChafaIvs</a> and Didier <a href="http://www.bibsonomy.org/author/Concordet">Concordet</a> </span><em>Journal of Statistical Planning and Inference</em><em>137(9):2774--2783</em><em>Sep2007. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceSep92774--2783On the strong consistency of asymptotic M-estimators1372007Maximum likelihood 01http://www.bibsonomy.org/bibtex/264ee95ce2a4999f15eef5b08313d2869/smichasmicha2008-04-23T22:05:04+02:00estimator likelihood maximum <span style="color:#555555;">Ping <a href="http://www.bibsonomy.org/author/Cheng">Cheng</a> and James C. <a href="http://www.bibsonomy.org/author/Fu">Fu</a> </span><em>Statistics \&amp; Probability Letters</em><em>4(4):173--178</em><em>Jun1986. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersJun4173--178On a fundamental optimality of the maximum likelihood estimator41986estimator likelihood maximum http://www.bibsonomy.org/bibtex/23f3e8c53ad114f6af075a952434dc58b/smichasmicha2008-04-23T22:05:04+02:00range Studentized test Maximum <span style="color:#555555;">Siu Hung <a href="http://www.bibsonomy.org/author/Cheung">Cheung</a> and Yaohua <a href="http://www.bibsonomy.org/author/Wu">Wu</a> </span><em>Statistics \&amp; Probability Letters</em><em>38(4):369--376</em><em>Jul1998. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersJul4369--376The power function of the maximum studentized range test in a two-way design381998range Studentized test Maximum 01http://www.bibsonomy.org/bibtex/2c736f731b4e9dc2b96e2318f24c6fce6/smichasmicha2008-04-23T22:05:04+02:00Maximum likelihood <span style="color:#555555;">Thierry <a href="http://www.bibsonomy.org/author/Chonavel">Chonavel</a> and Beno^it <a href="http://www.bibsonomy.org/author/Champagne">Champagne</a> and Christian <a href="http://www.bibsonomy.org/author/Riou">Riou</a> </span><em>Signal Processing</em><em>83(2):307--324</em><em>Feb2003. </em>Wed Apr 23 22:05:04 CEST 2008Signal ProcessingFeb2307--324Fast adaptive eigenvalue decomposition: a maximum likelihood approach832003Maximum likelihood http://www.bibsonomy.org/bibtex/2305b11af271b6463e0ef7f0014a52d5e/smichasmicha2008-04-23T22:05:04+02:00partial Maximum likelihood estimator <span style="color:#555555;">Daehyun <a href="http://www.bibsonomy.org/author/Chung">Chung</a> and Myron N. <a href="http://www.bibsonomy.org/author/Chang">Chang</a> </span><em>Statistics \&amp; Probability Letters</em><em>21(3):223--228</em><em>Oct1994. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersOct3223--228An isotonic estimator of the baseline hazard function in Cox's regression model under order restriction211994partial Maximum likelihood estimator 19http://www.bibsonomy.org/bibtex/205e31beae529a9d5c3d498de50d8549d/smichasmicha2008-04-23T22:05:04+02:00likelihood Maximum <span style="color:#555555;">Gauri Sankar <a href="http://www.bibsonomy.org/author/Datta">Datta</a> and Bannmo <a href="http://www.bibsonomy.org/author/Day">Day</a> and Ishwar <a href="http://www.bibsonomy.org/author/Basawa">Basawa</a> </span><em>Journal of Statistical Planning and Inference</em><em>75(2):269--279</em><em>Jan1999. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceJan2269--279Empirical best linear unbiased and empirical Bayes prediction in multivariate small area estimation751999likelihood Maximum 01http://www.bibsonomy.org/bibtex/28404e4b9a96c9ae79e933380818348cb/smichasmicha2008-04-23T22:05:04+02:00Maximum likelihood <span style="color:#555555;">Li <a href="http://www.bibsonomy.org/author/Deng">Deng</a> and Xuemin <a href="http://www.bibsonomy.org/author/Shen">Shen</a> </span><em>Signal Processing</em><em>57(1):65--79</em><em>Feb1997. </em>Wed Apr 23 22:05:04 CEST 2008Signal ProcessingFeb165--79Maximum likelihood in statistical estimation of dynamic systems: Decomposition algorithm and simulation results571997Maximum likelihood http://www.bibsonomy.org/bibtex/2973eb894ceb45adfde91b6252216d3ed/smichasmicha2008-04-23T22:05:04+02:00estimator Maximum likelihood <span style="color:#555555;">Tejas A. <a href="http://www.bibsonomy.org/author/Desai">Desai</a> and Pranab K. <a href="http://www.bibsonomy.org/author/Sen">Sen</a> </span><em>Journal of Statistical Planning and Inference</em><em>136(7):2309--2326</em><em>Jul2006. </em>Wed Apr 23 22:05:04 CEST 2008Journal of Statistical Planning and InferenceJul72309--2326Information attainable in some randomly incomplete data models1362006estimator Maximum likelihood 01http://www.bibsonomy.org/bibtex/217fff4a41314b1585b412f6a869d8f9f/smichasmicha2008-04-23T22:05:04+02:00Maximum theorems limit <span style="color:#555555;">I. <a href="http://www.bibsonomy.org/author/Fahrner">Fahrner</a> and U. <a href="http://www.bibsonomy.org/author/Stadtm{\&#034;u}ller">Stadtm&#252;ller</a> </span><em>Statistics \&amp; Probability Letters</em><em>37(3):229--236</em><em>Mar1998. </em>Wed Apr 23 22:05:04 CEST 2008Statistics \& Probability LettersMar3229--236On almost sure max-limit theorems371998Maximum theorems limit 16