Sciweavers

8067 search results - page 587 / 1614
» A Model Proposal of the Interoperability Problem
Sort
View
ECML
2006
Springer
15 years 10 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
ICDT
1995
ACM
105views Database» more  ICDT 1995»
15 years 10 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
RIVF
2007
15 years 8 months ago
Disambiguation of People in Web Search Using a Knowledge Base
— Results of queries by personal names often contain documents related to several people because of the namesake problem. In order to differentiate documents related to different...
Quang Minh Vu, Tomonari Masada, Atsuhiro Takasu, J...
DOA
2001
122views more  DOA 2001»
15 years 8 months ago
Component Search Service and Deployment of Distributed Applications
This paper presents and discusses some infrastructure services necessary for distributed applications development. The main service considered is the component search service whic...
Djemai Kebbal, Guy Bernard
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
15 years 8 months ago
Discriminating self from non-self with finite mixtures of multivariate Bernoulli distributions
Affinity functions are the core components in negative selection to discriminate self from non-self. It has been shown that affinity functions such as the r-contiguous distance an...
Thomas Stibor