Sciweavers

503 search results - page 87 / 101
» Output privacy in data mining
Sort
View
ICALP
2007
Springer
15 years 4 months ago
Private Multiparty Sampling and Approximation of Vector Combinations
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecc...
ICDM
2009
IEEE
145views Data Mining» more  ICDM 2009»
14 years 7 months ago
Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...
Nikolaj Tatti
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
15 years 10 months ago
Supervised probabilistic principal component analysis
Principal component analysis (PCA) has been extensively applied in data mining, pattern recognition and information retrieval for unsupervised dimensionality reduction. When label...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
KDD
2003
ACM
449views Data Mining» more  KDD 2003»
15 years 10 months ago
Passenger-based predictive modeling of airline no-show rates
Airlines routinely overbook flights based on the expectation that some fraction of booked passengers will not show for each flight. Accurate forecasts of the expected number of no...
Richard D. Lawrence, Se June Hong, Jacques Cherrie...
JCB
2007
118views more  JCB 2007»
14 years 9 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida