Sciweavers

515 search results - page 86 / 103
» Subsequence Matching on Structured Time Series Data
Sort
View
KDD
2004
ACM
144views Data Mining» more  KDD 2004»
14 years 8 months ago
IncSpan: incremental mining of sequential patterns in large database
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
Hong Cheng, Xifeng Yan, Jiawei Han
NN
2002
Springer
115views Neural Networks» more  NN 2002»
13 years 8 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 10 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
COMPGEOM
2006
ACM
14 years 2 months ago
Optimal succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
TCS
2008
13 years 8 months ago
Succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...