709 search results - page 113 / 142 » Constraint-Based Pattern Set Mining |
112
click to vote
KDD
2005
ACM
16 years 25 days ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
103
Voted
KDD
2004
ACM
16 years 25 days ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
104
click to vote
KDD
1998
ACM
15 years 4 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
We study the joint feature selection problem when learning multiple related classification or regression tasks. By imposing an automatic relevance determination prior on the hypo...
102
Voted
ISCI
2008
15 years 12 days ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...