排序方式: 共有33条查询结果,搜索用时 15 毫秒
11.
12.
13.
David Muggleton 《Pedagogy, Culture & Society》2005,13(2):273-280
Folk Devils and Moral Panics: the creation of the Mods and Rockers, 3rd Edn STANLEY COHEN, 2003 London: Routledge. 201 pp., £14.99, ISBN 0 415 26712 9 相似文献
14.
R G Button D F Muggleton E W Parnell 《Journal of the science of food and agriculture》1969,20(2):70-73
Decoquinate has been determined in edible chicken tissues by a spectrophotofluorimetric method during and after medication with 0.004% of the compound in the feed for five weeks. Mean concentrations (ppm fresh weight) of decoquinate observed during treatment were 1.1 (liver), 0.8 (kidney), 0.2 (muscle), 0.1 (blood), 1.6 (fat) and 1.0 (skin). Similar results were obtained with nine weeks' medication at 0.003 % and eight weeks at 0.008 %. Decoquinate was eliminated rapidly when medication ceased and all tissues contained < 0.1 p pm three-four days later. 相似文献
15.
16.
Inductive logic programming (ILP) has been applied to automatically discover protein fold signatures. This paper investigates the use of topological information to circumvent problems encountered during previous experiments, namely (1) matching of non-structurally related secondary structures and (2) scaling problems. Cross-validation tests were carried out for 20 folds. The overall estimated accuracy is 73.37+/-0.35%. The new representation allows us to process the complete set of examples, while previously it was necessary to sample the negative examples. Topological information is used in approximately 90% of the rules presented here. Information about the topology of a sheet is present in 63% of the rules. This set of rules presents characteristics of the overall architecture of the fold. In contrast, 26% of the rules contain topological information which is limited to the packing of a restricted number of secondary structures, as such, the later set resembles those found in our previous studies. 相似文献
17.
We revisit an application developed originally using abductive Inductive Logic Programming (ILP) for modeling inhibition in
metabolic networks. The example data was derived from studies of the effects of toxins on rats using Nuclear Magnetic Resonance
(NMR) time-trace analysis of their biofluids together with background knowledge representing a subset of the Kyoto Encyclopedia
of Genes and Genomes (KEGG). We now apply two Probabilistic ILP (PILP) approaches—abductive Stochastic Logic Programs (SLPs)
and PRogramming In Statistical modeling (PRISM) to the application. Both approaches support abductive learning and probability
predictions. Abductive SLPs are a PILP framework that provides possible worlds semantics to SLPs through abduction. Instead
of learning logic models from non-probabilistic examples as done in ILP, the PILP approach applied in this paper is based
on a general technique for introducing probability labels within a standard scientific experimental setting involving control
and treated data. Our results demonstrate that the PILP approach provides a way of learning probabilistic logic models from
probabilistic examples, and the PILP models learned from probabilistic examples lead to a significant decrease in error accompanied
by improved insight from the learned results compared with the PILP models learned from non-probabilistic examples. 相似文献
18.
19.
This paper presents a case study of a machine-aided knowledge discovery process within the general area of drug design. Within drug design, the particular problem of pharmacophore discovery is isolated, and the Inductive Logic Programming (ILP) system progol is applied to the problem of identifying potential pharmacophores for ACE inhibition. The case study reported in this paper supports four general lessons for machine learning and knowledge discovery, as well as more specific lessons for pharmacophore discovery, for Inductive Logic Programming, and for ACE inhibition. The general lessons for machine learning and knowledge discovery are as follows.1. An initial rediscovery step is a useful tool when approaching a new application domain.2. General machine learning heuristics may fail to match the details of an application domain, but it may be possible to successfully apply a heuristic-based algorithm in spite of the mismatch.3. A complete search for all plausible hypotheses can provide useful information to a user, although experimentation may be required to choose between competing hypotheses.4. A declarative knowledge representation facilitates the development and debugging of background knowledge in collaboration with a domain expert, as well as the communication of final results. 相似文献
20.