Dynamic quantum clustering: a method for visual exploration of structures in data

A given set of data-points in some feature space may be associated with a Schrodinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged dynamical scheme using a time-dependent Schrodinger equation. Moreover, we approximate this Hamiltonian formalism by a truncated calculation within a set of Gaussian wave functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition or feature filtering.Comment: 15 pages, 9 figure

Dynamical effects of the neutrino gravitational clustering at Planck angular scales

We study the CMB anisotropy induced by the non-linear perturbations in the massive neutrino density associated to the non-linear gravitational clustering proceses. Our results show that for the neutrino fraction in agreement with that indicated by the astroparticle and nuclear physics experiments and a cosmological accreting mass comparable with the mass of known clusters, the angular resolution and the sensitivity of the CMB anisotropy measurements from the Planck surveyor will allow the detection of the dynamical effects of the neutrino gravitational clustering.Comment: 40 pages and 12 figures, submitted to ApJ (14 March 2002

From Frequency to Meaning: Vector Space Models of Semantics

Computers understand very little of the meaning of human language. This profoundly limits our ability to give instructions to computers, the ability of computers to explain their actions to us, and the ability of computers to analyse and process text. Vector space models (VSMs) of semantics are beginning to address these limits. This paper surveys the use of VSMs for semantic processing of text. We organize the literature on VSMs according to the structure of the matrix in a VSM. There are currently three broad classes of VSMs, based on term-document, word-context, and pair-pattern matrices, yielding three classes of applications. We survey a broad range of applications in these three categories and we take a detailed look at a specific open source project in each category. Our goal in this survey is to show the breadth of applications of VSMs for semantics, to provide a new perspective on VSMs for those who are already familiar with the area, and to provide pointers into the literature for those who are less familiar with the field