257 search results - page 5 / 52 » Learning Unions of Tree Patterns Using Queries |
99
Voted
ICDT
2012
ACM
13 years 2 days ago
2012
ACM
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
163
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
DATAMINE
2010
14 years 9 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In the absence of explicit queries, an alternative is to try to infer users' interests from implicit feedback signals, such as clickstreams or eye tracking. The interests, fo...