Sciweavers

276 search results - page 53 / 56
» Frequent Submap Discovery
Sort
View
CIKM
2008
Springer
13 years 11 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
ACL
1992
13 years 10 months ago
SEXTANT: Exploring Unexplored Contexts for Semantic Extraction from Syntactic Analysis
For a very long time, it has been considered that the only way of automatically extracting similar groups of words from a text collection for which no semantic information exists ...
Gregory Grefenstette
ASC
2008
13 years 9 months ago
Info-fuzzy algorithms for mining dynamic data streams
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
Lior Cohen, Gil Avrahami, Mark Last, Abraham Kande...
BMCBI
2010
147views more  BMCBI 2010»
13 years 9 months ago
CNstream: A method for the identification and genotyping of copy number polymorphisms using Illumina microarrays
Background: Understanding the genetic basis of disease risk in depth requires an exhaustive knowledge of the types of genetic variation. Very recently, Copy Number Variants (CNVs)...
Arnald Alonso, Antonio Julià, Raül Tor...
BMCBI
2008
104views more  BMCBI 2008»
13 years 9 months ago
Missing value imputation improves clustering and interpretation of gene expression microarray data
Background: Missing values frequently pose problems in gene expression microarray experiments as they can hinder downstream analysis of the datasets. While several missing value i...
Johannes Tuikkala, Laura Elo, Olli Nevalainen, Ter...