Sciweavers

499 search results - page 50 / 100
» Automating exploratory data analysis for efficient data mini...
Sort
View
BMCBI
2010
144views more  BMCBI 2010»
13 years 7 months ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 1 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
SAC
2002
ACM
13 years 7 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
INCDM
2007
Springer
96views Data Mining» more  INCDM 2007»
14 years 1 months ago
Neural Business Control System
Small to medium sized companies require a business control mechanism in order to monitor their modus operandi and analyse whether they are achieving their goals. A tool for the dec...
María Lourdes Borrajo Diz, Juan M. Corchado...