252 search results - page 41 / 51 » Mining Frequent Patterns without Candidate Generation |
ICEIS
2009
IEEE
14 years 2 months ago
2009
IEEE
Data warehouses have been widely used in various capacities such as large corporations or public institutions. These systems contain large and rich datasets that are often used by ...
OTM
2007
Springer
14 years 2 months ago
2007
Springer
Creating executable semantic mappings is an important task for ontology-based information integration. Although it is argued that mapping tools may require interaction from humans ...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...