Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Abstract. To represent and manage data mining patterns, several aspects have to be taken into account: (i) patterns are heterogeneous in nature; (ii) patterns can be extracted from...
Barbara Catania, Anna Maddalena, Maurizio Mazza, E...
This paper provides evidence that the use of more unlabeled data in semi-supervised learning can improve the performance of Natural Language Processing (NLP) tasks, such as part-o...