Sciweavers

73 search results - page 14 / 15
» Efficient Algorithms for Attribute-Oriented Induction
Sort
View
CORR
2008
Springer
159views Education» more  CORR 2008»
13 years 5 months ago
Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data
We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same pro...
Bart Kuijpers, Vanessa Lemmens, Bart Moelans, Karl...
ESWA
2006
149views more  ESWA 2006»
13 years 5 months ago
An effective refinement strategy for KNN text classifier
Due to the exponential growth of documents on the Internet and the emergent need to organize them, the automated categorization of documents into predefined labels has received an...
Songbo Tan
IJCAI
2003
13 years 6 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
APN
2008
Springer
13 years 7 months ago
Hierarchical Set Decision Diagrams and Automatic Saturation
Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation ...
Alexandre Hamez, Yann Thierry-Mieg, Fabrice Kordon
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
13 years 10 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...