Sciweavers

72 search results - page 11 / 15
» Minimal Contraction of Preference Relations
Sort
View
ECAI
2000
Springer
14 years 1 months ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti
DLOG
2009
13 years 7 months ago
Reasoning About Typicality in ALC and EL
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attent...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
14 years 1 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
CN
2007
146views more  CN 2007»
13 years 9 months ago
Autonomic control and personalization of a wireless access network
As ICT services are becoming more ubiquitous and mobile and access technologies grow to be more heterogeneous and complex, we are witnessing the increasing importance of two relat...
Nicola Blefari-Melazzi, Dario Di Sorte, Mauro Femm...
EWSN
2007
Springer
14 years 9 months ago
An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
Quanbin Chen, Jian Ma, Yanmin Zhu, Dian Zhang, Lio...