Sciweavers

443 search results - page 53 / 89
» Partial Probability: Theory and Applications
Sort
View
92
Voted
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
15 years 11 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
15 years 11 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
15 years 11 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
CONCUR
2004
Springer
15 years 4 months ago
Probabilistic Event Structures and Domains
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
Daniele Varacca, Hagen Völzer, Glynn Winskel
118
Voted
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
14 years 11 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi