Sciweavers

1217 search results - page 95 / 244
» On compressing frequent patterns
Sort
View
MDAI
2010
Springer
15 years 2 months ago
Pattern Mining on Stars with FP-Growth
Abstract. Most existing data mining (DM) approaches look for patterns in a single table. Multi-relational DM approaches, on the other hand, look for patterns that involve multiple ...
Andreia Silva, Cláudia Antunes
KDD
2003
ACM
145views Data Mining» more  KDD 2003»
16 years 4 months ago
Carpenter: finding closed patterns in long biological datasets
The growth of bioinformatics has resulted in datasets with new characteristics. These datasets typically contain a large number of columns and a small number of rows. For example,...
Feng Pan, Gao Cong, Anthony K. H. Tung, Jiong Yang...
KBSE
2008
IEEE
15 years 10 months ago
Discovering Patterns of Change Types
The reasons why software is changed are manyfold; new features are added, bugs have to be fixed, or the consistency of coding rules has to be re-established. Since there are many...
Beat Fluri, Emanuel Giger, Harald Gall
SBBD
2007
126views Database» more  SBBD 2007»
15 years 5 months ago
Constraint-based Tree Pattern Mining
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
ISCAS
2005
IEEE
152views Hardware» more  ISCAS 2005»
15 years 9 months ago
Dictionary-based program compression on transport triggered architectures
— Program code size has become a critical design constraint of embedded systems. Large program codes require large memories, which increase the size and cost of the chip. Poor co...
Jari Heikkinen, Andrea G. M. Cilio, Jarmo Takala, ...