Sciweavers

2463 search results - page 76 / 493
» Compressing Pattern Databases
Sort
View
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
14 years 3 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
WWW
2010
ACM
14 years 5 months ago
HTTP database connector (HDBC): RESTful access to relational databases
Relational databases hold a vast quantity of information and making them accessible to the web is an big challenge. There is a need to make these databases accessible with as litt...
Alexandros Marinos, Erik Wilde, Jiannan Lu
CINQ
2004
Springer
177views Database» more  CINQ 2004»
14 years 3 months ago
Generic Pattern Mining Via Data Mining Template Library
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Templat...
Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Paol...
IEEESCC
2009
IEEE
14 years 5 months ago
Design Pattern for Object Triple Mapping
 Up to now, developing software for the Semantic Web is much more complex than developing software for other data representation paradigms, such as relational databases. Softwa...
Matthias Quasthoff, Christoph Meinel
ISCAS
2005
IEEE
152views Hardware» more  ISCAS 2005»
14 years 4 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, ...