28 search results - page 4 / 6 » ictai 2006 |
168
Voted
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approx...
133
click to vote
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
126
click to vote
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...
133
click to vote
ICTAI
2006
IEEE
15 years 10 months 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...
152
click to vote
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...