1583 search results - page 269 / 317 » Standardization and Competitive Advantage |
105
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
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...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
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...