Sciweavers

507 search results - page 58 / 102
» Sizes of Ordered Decision Trees
Sort
View
STACS
2001
Springer
14 years 8 days ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
IEEEARES
2010
IEEE
14 years 1 months ago
Heuristics for Detecting Botnet Coordinated Attacks
— This paper studies the analysis on the Cyber Clean Center (CCC) Data Set 2009, consisting of raw packets captured more than 90 independent honeypots, in order for detecting beh...
Kazuya Kuwabara, Hiroaki Kikuchi, Masato Terada, M...
DKE
2008
98views more  DKE 2008»
13 years 8 months ago
Privacy-preserving imputation of missing data
Handling missing data is a critical step to ensuring good results in data mining. Like most data mining algorithms, existing privacy-preserving data mining algorithms assume data ...
Geetha Jagannathan, Rebecca N. Wright
TKDE
2008
112views more  TKDE 2008»
13 years 7 months ago
IDD: A Supervised Interval Distance-Based Method for Discretization
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
Francisco J. Ruiz, Cecilio Angulo, Núria Ag...
CANDC
2005
ACM
13 years 7 months ago
Gene selection from microarray data for cancer classification - a machine learning approach
A DNA microarray can track the expression levels of thousands of genes simultaneously. Previous research has demonstrated that this technology can be useful in the classification ...
Yu Wang 0008, Igor V. Tetko, Mark A. Hall, Eibe Fr...