Sciweavers

17582 search results - page 3466 / 3517
» From Distributed Sequential Computing to Distributed Paralle...
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 2 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
MOBISYS
2009
ACM
16 years 2 months ago
A framework of energy efficient mobile sensing for automatic user state recognition
Urban sensing, participatory sensing, and user activity recognition can provide rich contextual information for mobile applications such as social networking and location-based se...
Yi Wang, Jialiu Lin, Murali Annavaram, Quinn Jacob...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 2 months ago
A hit-miss model for duplicate detection in the WHO drug safety database
The WHO Collaborating Centre for International Drug Monitoring in Uppsala, Sweden, maintains and analyses the world's largest database of reports on suspected adverse drug re...
Andrew Bate, G. Niklas Norén, Roland Orre
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
16 years 2 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 2 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
« Prev « First page 3466 / 3517 Last » Next »