BibSonomyburst/user/pitmanBibSonomy RSS feed for /user/pitman2012-02-15T08:09:20+01:00http://www.bibsonomy.org/bibtex/27187ba525f3487f4ef1f64c9950d2a0e/pitmanpitman2010-11-09T20:56:37+01:00convex_minorant <span class="authorEditorList"><a href="/author/Avellaneda">Marco Avellaneda</a>, and <a href="/author/Weinan">E Weinan</a> </span><em>Communications in Mathematical Physics</em> (<em>1995</em>)Tue Nov 09 20:56:37 CET 2010Berlin / HeidelbergCommunications in Mathematical Physics13-38Statistical properties of shocks in Burgers turbulence1721995convex_minorant We consider the statistical properties of solutions of Burgers' equation in the limit of vanishing viscosity, , with Gaussian whitenoise initial data. This system was originally proposed by Burgers[1] as a crude model of hydrodynamic turbulence, and more recently by Zel'dovichet al..[12] to describe the evolution of gravitational matter at large spatio-temporal scales, with shocks playing the role of mass clusters. We present here a rigorous proof of the scaling relationP(s)∞s1/2,s≪1 whereP(s) is the cumulative probability distribution of shock strengths. We also show that the set of spatial locations of shocks is discrete, i.e. has no accumulation points; and establish an upper bound on the tails of the shock-strength distribution, namely 1−P(s)≤exp{−Cs3} fors≫1. Our method draws on a remarkable connection existing between the structure of Burgers turbulence and classical probabilistic work on the convex envelope of Brownian motion and related diffusion processes.SpringerLink - Communications in Mathematical Physics, Volume 172, Number 1http://www.bibsonomy.org/bibtex/213389b80dc4b0d20edabb96f0932b2e1/pitmanpitman2010-11-09T03:23:10+01:00author_pitman_arthur clustering <span class="authorEditorList"><a href="/author/Pitman">Arthur Pitman</a>, <a href="/author/Zanker">Markus Zanker</a>, <a href="/author/Fuchs">Matthias Fuchs</a>, and <a href="/author/Lexhagen">Maria Lexhagen</a> </span><em>Information and Communication Technologies in Tourism 2010, </em><em>Springer Vienna, </em>(<em>2010</em>)Tue Nov 09 03:23:10 CET 2010Information and Communication Technologies in Tourism 2010393-403Web Usage Mining in Tourism — A Query Term Analysis and Clustering Approach2010author_pitman_arthur clustering According to current research, one of the most promising applications for web usage mining (WUM) is in identifying homogenous user subgroups (Liu, 2008). This paper presents a prototypical workflow and tools for analyzing user sessions to extract business intelligence hidden in web log data. By considering a leading Swedish destination gateway, we demonstrate how query term analysis in combination with session clustering can be utilized to effectively explore the information needs of website users. The system thus overcomes many of the limitations of typical web site analysis tools that only offer general statistics and ignore the opportunities offered by unsupervised learning techniques.SpringerLink - Abstracthttp://www.bibsonomy.org/bibtex/23d7818b02b308b39129f1f635e2925c7/pitmanpitman2010-11-05T23:01:48+01:00author_pitman_from_arxiv <span class="authorEditorList"><a href="/author/Gnedin">Alexander Gnedin</a>, and <a href="/author/Pitman">Jim Pitman</a> </span>(<em>2006</em>)Fri Nov 05 23:01:48 CET 2010{Moments of convex distribution functions and completely alternating sequences.}2006author_pitman_from_arxiv We solve the moment problem for convex distribution functions on $[0,1]$ in terms of completely alternating sequences. This complements a recent solution of this problem by Diaconis and Freedman, and relates this work to the Lévy-Khintchine formula for the Laplace transform of a subordinator, and to regenerative composition structures.http://www.bibsonomy.org/bibtex/266c810ff2c306d036592d06e0fa67ae8/pitmanpitman2010-10-31T05:45:57+01:00bibliography queues <span class="authorEditorList"><a href="/author/Takagi">Hideaki Takagi</a>, and <a href="/author/Boguslavsky">Leonid Boguslavsky</a> </span><em>Queueing Systems</em> (<em>1991</em>)Sun Oct 31 05:45:57 CET 2010Queueing Systems313-322A supplementary bibliography of books on queueing analysis and performance evaluation81991bibliography queues SpringerLink - Queueing Systems, Volume 8, Number 1http://www.bibsonomy.org/bibtex/22fd732d5bcc5a280b18500852267cfbd/pitmanpitman2010-10-31T05:44:32+01:00bibliography queues <span class="authorEditorList"><a href="/author/Prabhu">N. U. Prabhu</a> </span><em>Queueing Systems</em> (<em>1987</em>)Sun Oct 31 05:44:32 CET 2010Queueing Systems393-398A bibliography of books and survey papers on queueing systems: Theory and applications21987bibliography queues SpringerLink - Queueing Systems, Volume 2, Number 4http://www.bibsonomy.org/bibtex/2a3a779de8717fd11f3216ccec6ce56df/pitmanpitman2010-10-30T23:35:30+02:00Dept_Mathematics_Berkeley Dept_Statistics_Berkeley bpr99 maximum_and_minimum myown path_decomposition <span class="authorEditorList"><a href="/author/Bertoin">Jean Bertoin</a>, <a href="/author/Pitman">Jim Pitman</a>, and <a href="/author/de Chavez">Juan Ruiz de Chavez</a> </span><em>Electronic Comm. Probab.</em> (<em>1999</em>)Sat Oct 30 23:35:30 CEST 2010Electronic Comm. Probab.Paper 5, 1-7Constructions of a Brownian path with a given minimum41999Dept_Mathematics_Berkeley Dept_Statistics_Berkeley bpr99 maximum_and_minimum myown path_decomposition http://www.bibsonomy.org/bibtex/27a4e0d20a4764e650e91ad61a7fe9d46/pitmanpitman2009-10-04T06:39:04+02:00author identity name <span class="authorEditorList"><a href="/author/Torvik">Vetle I. Torvik</a>, and <a href="/author/Smalheiser">Neil R. Smalheiser</a> </span><em>ACM Trans. Knowl. Discov. Data</em> <em>3(3):1--29</em> (<em>2009</em>)Sun Oct 04 06:39:04 CEST 2009New York, NY, USAACM Trans. Knowl. Discov. Data31--29Author name disambiguation in MEDLINE32009author identity name Background: We recently described “Author-ity,” a model for estimating the probability that two articles in MEDLINE, sharing the same author name, were written by the same individual. Features include shared title words, journal name, coauthors, medical subject headings, language, affiliations, and author name features (middle initial, suffix, and prevalence in MEDLINE). Here we test the hypothesis that the Author-ity model will suffice to disambiguate author names for the vast majority of articles in MEDLINE. Methods: Enhancements include: (a) incorporating first names and their variants, email addresses, and correlations between specific last names and affiliation words; (b) new methods of generating large unbiased training sets; (c) new methods for estimating the prior probability; (d) a weighted least squares algorithm for correcting transitivity violations; and (e) a maximum likelihood based agglomerative algorithm for computing clusters of articles that represent inferred author-individuals. Results: Pairwise comparisons were computed for all author names on all 15.3 million articles in MEDLINE (2006 baseline), that share last name and first initial, to create Author-ity 2006, a database that has each name on each article assigned to one of 6.7 million inferred author-individual clusters. Recall is estimated at ∼98.8&percnt;. Lumping (putting two different individuals into the same cluster) affects ∼0.5&percnt; of clusters, whereas splitting (assigning articles written by the same individual to >1 cluster) affects ∼2&percnt; of articles. Impact: The Author-ity model can be applied generally to other bibliographic databases. Author name disambiguation allows information retrieval and data integration to become person-centered, not just document-centered, setting the stage for new data mining and social network tools that will facilitate the analysis of scholarly publishing and collaboration behavior. Availability: The Author-ity 2006 database is available for nonprofit academic research, and can be freely queried via http://arrowsmith.psych.uic.edu.Author name disambiguation in MEDLINEhttp://www.bibsonomy.org/bibtex/2542c043db57c6fb810e9bb67b61117cd/pitmanpitman2009-08-15T21:09:25+02:00bkn <span class="authorEditorList"><a href="/author/Bowers">Shawn Bowers</a>, and <a href="/author/Ludäscher">Bertram Ludäscher</a> </span><em>Current Trends in Database Technology – EDBT 2006, </em><em>page 712--723. </em>(<em>2006</em>)Sat Aug 15 21:09:25 CEST 2009Current Trends in Database Technology – EDBT 2006712--723A Calculus for Propagating Semantic Annotations Through Scientific Workflow Queries2006bkn Scientific workflows facilitate automation, reuse, and reproducibility of scientific data management and analysis tasks. Scientific workflows are often modeled as dataflow networks, chaining together processing components (called actors) that query, transform, analyse, and visualize scientific datasets. Semantic annotations relate data and actor schemas withconceptual information from a shared ontology, to support scientific workflow design, discovery, reuse, and validation inthe presence of thousands of potentially useful actors and datasets. However, the creation of semantic annotations is complexand time-consuming. We present a calculus and two inference algorithms to automatically propagate semantic annotations through workflow actors described by relational queries. Given an input annotation α and a query q, forward propagation computes an output annotation α′; conversely, backward propagation infers α from q and α′.SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/2f025b55684cd707362ab87c187b95edc/pitmanpitman2009-07-30T01:17:14+02:00imported <span class="authorEditorList"><a href="/author/Mifflin">R. Mifflin</a> </span><em>Siam Journal on Control</em> (<em>1977</em>)Thu Jul 30 01:17:14 CEST 2009Siam Journal on Control957--972Semismooth and semiconvex functions in constrained optimization151977imported This is the descriptionhttp://www.bibsonomy.org/bibtex/23a0b3fc24f2b1653dc28ca4cd2875c31/pitmanpitman2009-07-29T23:26:26+02:00problem schroeder trees_and_forests <span class="authorEditorList"><a href="/author/Riordan">John Riordan</a> </span><em>Acta Mathematica</em> <em>137(1):1--16</em> (<em>1976</em>)Wed Jul 29 23:26:26 CEST 2009Acta Mathematica11--16{The blossoming of Schröder's fourth problem}1371976problem schroeder trees_and_forests No abstractSpringerLink - Journal Articlehttp://www.bibsonomy.org/bibtex/20ee920ec4ea059ea7c8f191652bef2b0/pitmanpitman2009-07-29T23:17:39+02:00clustering partition tree <span class="authorEditorList"><a href="/author/Křivánek">Mirko Křivánek</a>, and <a href="/author/Morávek">Jaroslav Morávek</a> </span><em>Acta Informatica</em> <em>23(3):311--323</em> (<em>1986</em>)Wed Jul 29 23:17:39 CEST 2009Acta Informatica3311--323NP-hard problems in hierarchical-tree clustering231986clustering partition tree We consider a class of optimization problems of hierarchical-tree clustering and prove that these problems are NP-hard. The sequence of polynomial reductions and/or transformations used in our proof is based on relatively laborious graph-theoretical constructions and starts in the NP-complete problem of 3-dimensional matching. Using our main result we establish the NP-completeness of a problem of the best approximation of a symmetric relation on a finite set by an equivalence relation, thus answering in the negative a question proposed implicitly by C.T. Zahn. ER -SpringerLink - Journal Articlehttp://www.bibsonomy.org/bibtex/2ca4ff976007ae6250592d071fad0b67e/pitmanpitman2009-07-29T23:16:43+02:00clustering <span class="authorEditorList"><a href="/author/Vichi">Maurizio Vichi</a> </span><em>Advances in Data Analysis and Classification</em> <em>2(2):121--161</em> (<em>2008</em>)Wed Jul 29 23:16:43 CEST 2009Advances in Data Analysis and Classification2121--161Fitting semiparametric clustering models to dissimilarity data22008clustering The cluster analysis problem of partitioning a set of objects from dissimilarity data is here handled with the statistical model-based approach of fitting the “closest” classification matrix to the observed dissimilarities. A classification matrix represents a clustering structure expressed in terms of dissimilarities.In cluster analysis there is a lack of methodologies widely used to directly partition a set of objects from dissimilaritydata. In real applications, a hierarchical clustering algorithm is applied on dissimilarities and subsequently a partitionis chosen by visual inspection of the dendrogram. Alternatively, a “tandem analysis” is used by first applying a MultidimensionalScaling (MDS) algorithm and then by using a partitioning algorithm such as k-means applied on the dimensions specified by the MDS. However, neither the hierarchical clustering algorithms nor the tandemanalysis is specifically defined to solve the statistical problem of fitting the closest partition to the observed dissimilarities.This lack of appropriate methodologies motivates this paper, in particular, the introduction and the study of three new objectpartitioning models for dissimilarity data, their estimation via least-squares and the introduction of three new fast algorithms.SpringerLink - Journal Articlehttp://www.bibsonomy.org/bibtex/243a8456965c74ae1a02fbb80c499b949/pitmanpitman2009-07-29T23:15:37+02:00bibliography math <span class="authorEditorList"><a href="/author/?"> ?</a> </span><em>Nexus Network Journal</em> <em>5(1):177--188</em> (<em>2003</em>)Wed Jul 29 23:15:37 CEST 2009Nexus Network Journal1177--188An Annotated Bibliography of Books for Architecture and Mathematics52003bibliography math SpringerLink - Journal Articlehttp://www.bibsonomy.org/bibtex/22ffb00bfdb151f2ad106cf9914a63475/pitmanpitman2009-04-17T16:18:37+02:00assessment evaluation journals ranking research <span class="authorEditorList"><a href="/author/Frosini">Benito V. Frosini</a> </span><em>Statistica \&amp; Società</em> (<em>2008</em>)Fri Apr 17 16:18:37 CEST 2009Statistica \& Società39--47Valutazione della ricerca e valutazione delle riviste scientifiche in ambito statisticoVI speciale2008assessment evaluation journals ranking research (Translation of the abstract) The first part of the report is dedicated to various problems concerning the evaluation of research in general, with reference to the assessment exercises conducted in Italy, USA and the United Kingdom. The second part describes a classification of journals in Statistics and Demography, prepared by a commission nominated by the Societ\'a Italiana di Statistica.http://www.bibsonomy.org/bibtex/28c7ac68ceb2d0afa9cbb6d586867048b/pitmanpitman2009-04-17T16:08:54+02:00peer review <span class="authorEditorList"><a href="/author/Ellison">Glenn Ellison</a> </span><em>Working Paper, </em><em>13272. </em><em>National Bureau of Economic Research, </em>(<em>July 2007</em>)Fri Apr 17 16:08:54 CEST 2009July13272Working Paper SeriesIs Peer Review in Decline?Working Paper2007peer review http://www.bibsonomy.org/bibtex/225f7c308c1fc943215af306e76e458b0/pitmanpitman2009-04-03T17:59:10+02:00bookmarking relatedness semantic social systems <span class="authorEditorList"><a href="/author/Cattuto">Ciro Cattuto</a>, <a href="/author/Benz">Dominik Benz</a>, <a href="/author/Hotho">Andreas Hotho</a>, and <a href="/author/Stumme">Gerd Stumme</a> </span><em>The Semantic Web - ISWC 2008, Proc.Intl. Semantic Web Conference 2008, </em><em>volume 5318 of LNAI, </em><em>page 615--631. </em><em>Heidelberg, </em><em>Springer, </em>(<em>2008</em>)Fri Apr 03 17:59:10 CEST 2009HeidelbergThe Semantic Web - ISWC 2008, Proc.Intl. Semantic Web Conference 2008615--631LNAISemantic Grounding of Tag Relatedness in Social Bookmarking Systems53182008bookmarking relatedness semantic social systems Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application.http://www.bibsonomy.org/bibtex/24863e91b4f913f0c737404f9db3f9ed7/pitmanpitman2009-03-22T17:06:01+01:00enumeration renewal trees <span class="authorEditorList"><a href="/author/Kettle">S. ER Kettle</a> </span><em>Combinatorial Mathematics X</em> (<em>1983</em>)Sun Mar 22 17:06:01 CET 2009Combinatorial Mathematics X244--274Families enumerated by the schröder-etherington sequence and a renewal array it generates1983enumeration renewal trees SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/219e98b1612a2ace825de2ce43a495412/pitmanpitman2009-03-22T05:54:24+01:00imported <span class="authorEditorList"><a href="/author/Bovier">A. Bovier</a>, and <a href="/author/Kurkova">I. Kurkova</a> </span>(<em>2004</em>)<em>Preprint . </em>Sun Mar 22 05:54:24 CET 2009PreprintDerrida's Generalized Random Energy models 4. Continuous state branching and coalescents2004imported Ruelle Cascades Bibhttp://www.bibsonomy.org/bibtex/2c2bab834905d33be4b59041461de04d8/pitmanpitman2009-02-22T18:08:33+01:002003 NSF information knowledge workshop <span class="authorEditorList"><a href="/author/?"> ?</a> </span><em>published on the web by University of Pittsburgh, School of Information Sciences, </em>(<em>2003</em>)<em>Report on the NSF Workshop on Research Directions for Digital Libraries, June 15-17, 2003, Chatham, MA . </em>Sun Feb 22 18:08:33 CET 2009published on the web by University of Pittsburgh, School of Information SciencesReport on the NSF Workshop on Research Directions for Digital Libraries, June 15-17, 2003, Chatham, MAKnowledge lost in information20032003 NSF information knowledge workshop NSF Award IIS-0331314http://www.bibsonomy.org/bibtex/2428d7c74895e48d7e0d6676b7669d3f5/pitmanpitman2009-02-07T20:30:14+01:00imported <span class="authorEditorList"><a href="/author/Nayak">Tapan K. Nayak</a> </span><em>Communications in Statistics - Theory and Methods</em> (<em>1996</em>)Sat Feb 07 20:30:14 CET 2009Taylor & FrancisCommunications in Statistics - Theory and Methods2039 - 20569On estimating the conditional probability of discovering a new species251996imported