Sciweavers

2673 search results - page 99 / 535
» Architectural Support for Data Mining
Sort
View
KDD
1999
ACM
108views Data Mining» more  KDD 1999»
15 years 8 months ago
Mining the Most Interesting Rules
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
Roberto J. Bayardo Jr., Rakesh Agrawal
CC
2008
Springer
123views System Software» more  CC 2008»
15 years 6 months ago
Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts
Portable low-level C programs must often support multiple equivalent in-memory layouts of data, due to the byte or bit order of the compiler, architecture, or external data formats...
Marius Nita, Dan Grossman
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
15 years 2 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
15 years 2 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
210
Voted
PAKDD
2011
ACM
253views Data Mining» more  PAKDD 2011»
14 years 7 months ago
Balance Support Vector Machines Locally Using the Structural Similarity Kernel
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
Jianxin Wu