Sciweavers

418 search results - page 67 / 84
» A New Pattern Representation Scheme Using Data Compression
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 4 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
BMCBI
2011
14 years 4 months ago
PhyloMap: an algorithm for visualizing relationships of large sequence data sets and its application to the influenza A virus ge
Background: Results of phylogenetic analysis are often visualized as phylogenetic trees. Such a tree can typically only include up to a few hundred sequences. When more than a few...
Jiajie Zhang, Amir Madany Mamlouk, Thomas Martinet...
INFOVIS
2005
IEEE
15 years 6 months ago
Parallel Sets: Visual Analysis of Categorical Data
The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical...
Fabian Bendix, Robert Kosara, Helwig Hauser
88
Voted
MS
2003
15 years 2 months ago
Information-theoretic Competitive Learning
— In this paper, we propose a new supervised learning method whereby information is controlled by the associated cost in an intermediate layer, and in an output layer, errors bet...
Ryotaro Kamimura
97
Voted
DEXA
2001
Springer
112views Database» more  DEXA 2001»
15 years 5 months ago
An Information-Driven Framework for Image Mining
Image mining systems that can automatically extract semantically meaningful information (knowledge) from image data are increasingly in demand. The fundamental challenge in image m...
Ji Zhang, Wynne Hsu, Mong-Li Lee