Sciweavers

1217 search results - page 76 / 244
» On compressing frequent patterns
Sort
View
134
Voted
ICCD
2006
IEEE
117views Hardware» more  ICCD 2006»
16 years 23 days ago
Fast, Performance-Optimized Partial Match Address Compression for Low-Latency On-Chip Address Buses
— The influence of interconnects on processor performance and cost is becoming increasingly pronounced with technology scaling. In this paper, we present a fast compression sche...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...
ICDAR
2003
IEEE
15 years 9 months ago
Writer Identification based on the fractal construction of a reference base
Our aim is to achieve writer identification process thanks to a fractal analysis of handwriting style. For each writer, a set of characteristics is extracted. They are specific to...
Audrey Seropian, M. Grimaldi, Nicole Vincent
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
16 years 5 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
DKE
2008
113views more  DKE 2008»
15 years 3 months ago
An efficient algorithm for mining closed inter-transaction itemsets
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
Anthony J. T. Lee, Chun-sheng Wang, Wan-Yu Weng, Y...
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
15 years 9 months ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee