90,376 research outputs found
Pac-Learning Recursive Logic Programs: Efficient Algorithms
We present algorithms that learn certain classes of function-free recursive
logic programs in polynomial time from equivalence queries. In particular, we
show that a single k-ary recursive constant-depth determinate clause is
learnable. Two-clause programs consisting of one learnable recursive clause and
one constant-depth determinate non-recursive clause are also learnable, if an
additional ``basecase'' oracle is assumed. These results immediately imply the
pac-learnability of these classes. Although these classes of learnable
recursive programs are very constrained, it is shown in a companion paper that
they are maximally general, in that generalizing either class in any natural
way leads to a computationally difficult learning problem. Thus, taken together
with its companion paper, this paper establishes a boundary of efficient
learnability for recursive logic programs.Comment: See http://www.jair.org/ for any accompanying file
Automatic Classification of Text Databases through Query Probing
Many text databases on the web are "hidden" behind search interfaces, and
their documents are only accessible through querying. Search engines typically
ignore the contents of such search-only databases. Recently, Yahoo-like
directories have started to manually organize these databases into categories
that users can browse to find these valuable resources. We propose a novel
strategy to automate the classification of search-only text databases. Our
technique starts by training a rule-based document classifier, and then uses
the classifier's rules to generate probing queries. The queries are sent to the
text databases, which are then classified based on the number of matches that
they produce for each query. We report some initial exploratory experiments
that show that our approach is promising to automatically characterize the
contents of text databases accessible on the web.Comment: 7 pages, 1 figur
The face, beauty, and symmetry: Perceiving asymmetry in beautiful faces
The relationship between bilateral facial symmetry and beauty remains to be clarified. Here, straight head-on photographs of “beautiful” faces from the collections of professional modeling agencies were selected. First, beauty ratings were obtained for these faces. Then, the authors created symmetrical left-left and right-right composites of the beautiful faces and asked a new group of subjects to choose the most attractive pair member. “Same” responses were allowed. No difference between the left-left and right-right composites was revealed but significant differences were obtained between “same” and the left-left or right-right. These results show that subjects detected asymmetry in beauty and suggest that very beautiful faces can be functionally asymmetrical
Relative importance of crystal field versus bandwidth to the high pressure spin transition in transition metal monoxides
The crystal field splitting and d bandwidth of the 3d transition metal
monoxides MnO, FeO, CoO and NiO are analyzed as a function of pressure within
density functional theory. In all four cases the 3d bandwidth is significantly
larger than the crystal field splitting over a wide range of compressions. The
bandwidth actually increases more as pressure is increased than the crystal
field splitting. Therefore the role of increasing bandwidth must be considered
in any explanation of a possible spin collapse that these materials may exhibit
under pressure.Comment: 7 pages, 4 figure
- …