Sciweavers

158 search results - page 21 / 32
» Discovering frequent patterns in sensitive data
Sort
View
GRC
2008
IEEE
13 years 8 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li
VLDB
1999
ACM
188views Database» more  VLDB 1999»
13 years 11 months ago
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
ENC
2004
IEEE
13 years 11 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
AI
2003
Springer
14 years 22 days ago
Efficient Mining of Indirect Associations Using HI-Mine
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
JIIS
2006
124views more  JIIS 2006»
13 years 7 months ago
An efficient approach to mining indirect associations
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An