Database and XML Technologies
4th International XML Database Symposium, XSym 2006 Seoul, Korea, September 10-11, 2006 Proceedings
Chapter
We tackle the question of checking hypotheses on user data. In particular, we address the challenges that arise in the context of testing an input hypothesis on many data samples, in our case, user groups. Thi...
Reference Work Entry In depth
Reference Work Entry In depth
Reference Work Entry In depth
Reference Work Entry In depth
Reference Work Entry In depth
Reference Work Entry In depth
Living Reference Work Entry In depth
Living Reference Work Entry In depth
Living Reference Work Entry In depth
Living Reference Work Entry In depth
Living Reference Work Entry In depth
Living Reference Work Entry In depth
Chapter and Conference Paper
We are interested in discovering user groups from collaborative rating datasets of the form \(\langle i, u, s\rangle \) ...
Chapter and Conference Paper
We introduce TopPI, a new semantics and algorithm designed to mine long-tailed datasets. For each item, and regardless of its frequency, TopPI finds the k most frequent closed itemsets that item belongs to. For e...
Article
Numerical data (e.g., DNA micro-array data, sensor data) pose a challenging problem to existing frequent pattern mining methods which hardly handle them. In this framework, gradual patterns have been recently ...
Chapter
With the advent of Web 2.0 users are producing bigger and bigger amounts of diverse data, which are stored in a large variety of systems. Since the users’ data spaces are scattered among those independent syst...
Chapter
The rapid emergence of XML as a standard for data representation and exchange over the Web has sparked considerable interest in models and efficient mechanisms for controlled access, especially using queries, ...
Book and Conference Proceedings
4th International XML Database Symposium, XSym 2006 Seoul, Korea, September 10-11, 2006 Proceedings
Chapter and Conference Paper
We study the expressiveness and performance of full-text search languages. Our motivation is to provide a formal basis for comparing full-text search languages and to develop a model for full-text search that ...