Sciweavers

5758 search results - page 256 / 1152
» Anonymity-preserving data collection
Sort
View
SDM
2008
SIAM
114views Data Mining» more  SDM 2008»
15 years 8 months ago
Semi-Supervised Classification with Universum
The Universum data, defined as a collection of "nonexamples" that do not belong to any class of interest, have been shown to encode some prior knowledge by representing ...
Dan Zhang, Jingdong Wang, Fei Wang, Changshui Zhan...
USENIX
2003
15 years 8 months ago
A Cooperative Internet Backup Scheme
We present a novel peer-to-peer backup technique that allows computers connected to the Internet to back up their data cooperatively: Each computer has a set of partner computers,...
Mark Lillibridge, Sameh Elnikety, Andrew Birrell, ...
CSDA
2006
84views more  CSDA 2006»
15 years 6 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans
PERVASIVE
2008
Springer
15 years 6 months ago
Cooperative Techniques Supporting Sensor-Based People-Centric Inferencing
Abstract. People-centric sensor-based applications targeting mobile device users offer enormous potential. However, learning inference models in this setting is hampered by the lac...
Nicholas D. Lane, Hong Lu, Shane B. Eisenman, Andr...
CIKM
2010
Springer
15 years 5 months ago
Yes we can: simplex volume maximization for descriptive web-scale matrix factorization
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
Christian Thurau, Kristian Kersting, Christian Bau...