4791 search results - page 91 / 959 » Clustering with partial information |
ACL
1998
15 years 1 months ago
1998
In this paper we deal with several kinds of anaphora in unrestricted texts. These kinds of anaphora are pronominal references, surfacecount anaphora and one-anaphora. In order to ...
EWCBR
2004
Springer
2004
Springer
Facilitating CBR for Incompletely-Described Cases: Distance Metrics for Partial Problem Descriptions
15 years 5 months ago
A fundamental problem for case-based reasoning systems is how to select relevant prior cases. Numerous strategies have been developed for determining the similarity of prior cases,...
IJDAR
2008
14 years 12 months ago
2008
For character recognition in document analysis, some classes are closely overlapped but are not necessarily to be separated before contextual information is exploited. For classifi...
111
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
112
click to vote
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...