2018 search results - page 285 / 404 » Magnitude-preserving ranking algorithms |
171
Voted
FSTTCS
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
151
click to vote
PKDD
2007
Springer
16 years 8 days ago
2007
Springer
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
162
Voted
ICTAI
2006
IEEE
16 years 5 days ago
2006
IEEE
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
174
Voted
ROCAI
2004
Springer
15 years 11 months ago
2004
Springer
For many years now, there is a growing interest around ROC curve for characterizing machine learning performances. This is particularly due to the fact that in real-world problems ...
165
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
Most data mining algorithms and tools stop at discovered customer models, producing distribution information on customer profiles. Such techniques, when applied to industrial pro...