High Fidelity Vector Space Models of Structured Data. (arXiv:1901.02565v1 [cs.AI])

Machine learning systems regularly deal with structured data in real-world
applications. Unfortunately, such data has been difficult to faithfully
represent in a way that most machine learning techniques would expect, i.e. as
a real-valued vector of a fixed, pre-specified size. In this work, we introduce
a novel approach that compiles structured data into a satisfiability problem
which has in its set of solutions at least (and often only) the input data. The
satisfiability problem is constructed from constraints which are generated
automatically a priori from a given signature, thus trivially allowing for a
bag-of-words-esque vector representation of the input to be constructed. The
method is demonstrated in two areas, automated reasoning and natural language
processing, where it is shown to be near-perfect in producing vector
representations of natural-language sentences and first-order logic clauses
that can be translated back to their original, structured input forms.

Source link

WordPress database error: [Error writing file '/tmp/MY91rk3V' (Errcode: 28 - No space left on device)]
SELECT SQL_CALC_FOUND_ROWS wp_posts.ID FROM wp_posts LEFT JOIN wp_term_relationships ON (wp_posts.ID = wp_term_relationships.object_id) WHERE 1=1 AND wp_posts.ID NOT IN (131936) AND ( wp_term_relationships.term_taxonomy_id IN (313) ) AND wp_posts.post_type = 'post' AND (wp_posts.post_status = 'publish') GROUP BY wp_posts.ID ORDER BY RAND() LIMIT 0, 3

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More

Privacy & Cookies Policy