574 search results - page 31 / 115 » Maximum Margin Clustering |
ACL
2011
12 years 11 months ago
2011
We consider a semi-supervised setting for domain adaptation where only unlabeled data is available for the target domain. One way to tackle this problem is to train a generative m...
AUSAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a novel algorithm called DBSC, which finds subspace clusters in numerical datasets based on the concept of ”dependency”. This algorithm employs a depth-...
ISPDC
2005
IEEE
14 years 1 months ago
2005
IEEE
The support on cluster environments of ”legacy protocols” is important to avoid rewriting the code of applications, but this support should not prevent to achieve the maximum ...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
ACL
2008
13 years 9 months ago
2008
Statistical machine learning methods are employed to train a Named Entity Recognizer from annotated data. Methods like Maximum Entropy and Conditional Random Fields make use of fe...