Result 101 to 120 from 125 total
Identifying and eliminating irrelevant instances using information theory. (English)
Hamilton, Howard J. (ed.), Advances in artificial intelligence. 13th biennial conference of the Canadian Society for Computational Studies of Intelligence, AI 2000, Montréal, Quebec, Canada, May 14-17, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1822, 90-101 (2000).
101
Impact of learning set quality and size on decision tree performances (English)
Int. J. Comput. Syst. Signal 1, No. 1, 85-105 (2000).
102
Contribution of dataset reduction techniques to tree-simplification and knowledge discovery (English)
PKDD, 44-53 (2000).
103
A symmetric nearest neighbor learning rule (English)
EWCBR, 222-233 (2000).
104
Sorted region merging to maximize test reliability (English)
ICIP (2000).
105
A concentration-based adaptive approach to region merging of optimal time and space complexities (English)
BMVC (2000).
106
Instance pruning as an information preserving problem (English)
ICML, 855-862 (2000).
107
Sharper bounds for the hardness of prototype and feature selection (English)
ALT, 224-237 (2000).
108
Combining feature and example pruning by uncertainty minimization (English)
UAI, 533-540 (2000).
109
A boosting-based prototype weighting and selection scheme (English)
FLAIRS Conference, 71-75 (2000).
110
Identifying and eliminating irrelevant instances using information theory (English)
Canadian Conference on AI, 90-101 (2000).
111
Decision tree based induction of decision lists. (English)
Intell. Data Anal. 3, No. 3, 227-240 (1999).
112
Complexity in the case against accuracy: When building one function-free Horn clause is as hard as any. (English)
Watanabe, Osamu (ed.) et al., Algorithmic learning theory. 10th international conference, ALT ’99, Tokyo, Japan, December 6-8, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1720, 182-193 (1999).
113
Contribution of boosting in wrapper models (English)
PKDD, 214-222 (1999).
114
Experiments on a representation-independent "top-down and prune" induction scheme (English)
PKDD, 223-231 (1999).
115
Complexity in the case against accuracy: when building one function-free Horn clause is as hard as any (English)
ATL, 182-193 (1999).
116
A “top-down and prune” induction scheme for constrained decision committees (English)
IDA, 27-38 (1999).
117
Generalized graph colorability and compressibility of Boolean formulae. (English)
Chwa, Kyung-Yong (ed.) et al., Algorithms and computation. 9th international symposium, ISAAC ’98. Taejon, Korea, December 14‒16, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1533, 237-246 (1998).
118
On the power of decision lists (English)
ICML, 413-420 (1998).
119
Oracles and assistants: machine learning applied to network supervision (English)
Canadian Conference on AI, 86-98 (1998).
120
Result 101 to 120 from 125 total
Start
Contact
Print
General Help
