Sciweavers

1422 search results - page 141 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
93
Voted
GD
2004
Springer
15 years 8 months ago
Clustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...
150
Voted
DOCENG
2006
ACM
15 years 9 months ago
Content based SMS spam filtering
In the recent years, we have witnessed a dramatic increment in the volume of spam email. Other related forms of spam are increasingly revealing as a problem of importance, special...
José María Gómez Hidalgo, Gui...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 3 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
145
Voted
ICML
2009
IEEE
16 years 4 months ago
Deep transfer via second-order Markov logic
Standard inductive learning requires that training and test instances come from the same distribution. Transfer learning seeks to remove this restriction. In shallow transfer, tes...
Jesse Davis, Pedro Domingos
125
Voted
IJCAI
2007
15 years 4 months ago
Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi...
Shin-ichi Minato, Ken Satoh, Taisuke Sato