Sciweavers

202 search results - page 13 / 41
» Algorithmic Information Theory and Foundations of Probabilit...
Sort
View
PODS
2001
ACM
148views Database» more  PODS 2001»
14 years 8 months ago
On the Design and Quantification of Privacy Preserving Data Mining Algorithms
The increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms ...
Dakshi Agrawal, Charu C. Aggarwal
PR
2007
189views more  PR 2007»
13 years 8 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
SIGIR
2008
ACM
13 years 8 months ago
Posterior probabilistic clustering using NMF
We introduce the posterior probabilistic clustering (PPC), which provides a rigorous posterior probability interpretation for Nonnegative Matrix Factorization (NMF) and removes th...
Chris H. Q. Ding, Tao Li, Dijun Luo, Wei Peng
FUIN
2008
112views more  FUIN 2008»
13 years 8 months ago
A New Probabilistic Approach for Fractal Based Image Compression
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
Suman K. Mitra, Malay Kumar Kundu, C. A. Murthy, B...
ICC
2011
IEEE
219views Communications» more  ICC 2011»
12 years 8 months ago
Deterministic Equivalents for the Performance Analysis of Isometric Random Precoded Systems
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
Jakob Hoydis, Romain Couillet, Mérouane Deb...