Sciweavers

21 search results - page 4 / 5
» Relation-Algebraic Derivation of Spanning Tree Algorithms
Sort
View
ACMSE
2009
ACM
14 years 3 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang
IJCNN
2000
IEEE
14 years 29 days ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
BMCBI
2010
178views more  BMCBI 2010»
13 years 8 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
CIKM
2007
Springer
14 years 2 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
JPDC
2006
187views more  JPDC 2006»
13 years 8 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna