Videos tagged with Statistics

Google Tech Talk (more info below) June 6, 2011 Presented by Hadley Wickham, Assistant Professor, Dobelman Family Junior Chair, Department of Statistics, Rice University. ABSTRACT Data analysis, the process of converting data into knowledge, insight and understanding, is a critical part of statistics, but there's surprisingly little research on it. In this talk I'll introduce some of my recent ...

Get stats on your mouse and keyboard activityEver wondered how many miles your mouse tracks in a day? How many right clicks or keyboard presses you use each week? Now you can find out, thanks to Win-O-Meter. Tune in to today's Tekzilla Daily to find out all those stats and more!

Bring back XP's blinking networking iconDo you miss XP and Vista's blinking network icon? On today's Tekzilla Daily, Veronica shows you how to bring it back to Windows 7 with the help of the free tool called Network Activity Indicator.

Map your fellow GooglersCurious about where all those Google users live that are searching for, for example, "Revision3"? Veronica reveals a sweet Google site that uncovers all those details.

Summary Avi Bryant talks about the iterative process that led to Trendly (http://trendly.com/ ), using Javascript, Ruby and Java in the process. He goes on to give his view on the state of Smalltalk and Squeak and talks about his experiments with writing a Smalltalk that compiles to idiomatic Javascript to make use of all the modern Javascript VMs. Bio Avi Bryant is the co-CEO of Dabble DB, a V...

The cluster variation method (CVM) is a hierarchy of approximate variational techniques for discrete (Ising-like) models in equilibrium statistical mechanics, improving on the mean-field approximation and the Bethe--Peierls approximation, which can be regarded as the lowest level of the CVM. The foundations of the CVM are briefly reviewed, considering different derivations of the method and rel...

We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. "similar" point pairs. We define the similarity in information theoretic terms, as the gain in coding length when shifting from independent encoding of the pair to joint encoding. Under simple Gaussian assumptions, this formulation leads to a non-Mahalanobis similarity functi...

Every material has a distinctive spectrum. The spectrum of a material tells us about its chemistry. Hyperspectral images produce a spectrum (represented as several hundred numbers) at each pixel in an image. So hyperspectral images enable us to map variations in chemistry. The first hyperspectral scanners, built in the 1980's and 1990's, were designed for airborne applications, primarily for mi...

Lecture slides: Advances in False Discovery Rate control applied in Neuroimaging Outline Voxel-based morphometry Vertex-based morphometry Pial (outside) surface White matter surface Wireframe Multiple comparisons Searching for interesting results Outline Definition Markov Random Fields Permutation tests. Weakness with blob-based methods The original concept The method Graphical FDR in practice ...

We study the problem of simultaneously estimating several densities where the datasets are organized into overlapping groups, such as a hierarchy. For this problem, we propose a maximum entropy formulation, which systematically incorporates the groups and allows us to share the strength of prediction across similar datasets. We derive general performance guarantees, and show how some previous a...