Sciweavers

4541 search results - page 492 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 8 months ago
Factorised representations of query results: size bounds and readability
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...
Dan Olteanu, Jakub Zavodny
AUSDM
2007
Springer
164views Data Mining» more  AUSDM 2007»
16 years 15 days ago
SemGrAM - Integrating Semantic Graphs into Association Rule Mining
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
John F. Roddick, Peter Fule
ITCC
2005
IEEE
15 years 12 months ago
Mining Biomedical Images with Density-Based Clustering
Density-based clustering algorithms have recently gained popularity in the data mining field due to their ability to discover arbitrary shaped clusters while preserving spatial pr...
M. Emre Celebi, Y. Alp Aslandogan, Paul R. Bergstr...
ECSQARU
2005
Springer
15 years 12 months ago
On the Use of Restrictions for Learning Bayesian Networks
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
Luis M. de Campos, Javier Gomez Castellano
172
Voted
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 11 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar