4085 search results - page 423 / 817 » Benchmarking Data Mining Algorithms |
135
click to vote
PAKDD
2010
ACM
15 years 9 months ago
2010
ACM
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
145
Voted
PAKDD
2001
ACM
15 years 9 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
146
click to vote
KDD
1995
ACM
15 years 8 months ago
1995
ACM
The Bayesianclassifier is a simple approachto classification that producesresults that are easy for people to interpret. In many cases, the Bayesianclassifieris at leastasaccurate...
141
click to vote
ICDM
2009
IEEE
15 years 2 months ago
2009
IEEE
Efficient acquisition of constraint networks is a key factor for the applicability of constraint problem solving methods. Current techniques ease knowledge acquisition by generati...
143
Voted
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...