Mining spatiotemporally invariant patterns
Abstract
References
Index Terms
- Mining spatiotemporally invariant patterns
Recommendations
An efficient and effective algorithm for mining top-rank-k frequent patterns
Using N-list structure for mining top-rank-k frequent patterns effectively.Subsume concept was also used to speed up the runtime of the mining process.The experiment was conducted to show the effectiveness of the proposed algorithm. Frequent pattern ...
A novel approach for mining maximal frequent patterns
An N-list structure is used to compress the dataset for mining Maximal Frequent Patterns.A pruning technique is then proposed and used in INLA-MFP algorithm to improve the runtime and memory usage.Experiments were conducted to show that INLA-MFP ...
A New Approach for Mining Top-Rank-k Erasable Itemsets
ACIIDS 2014: Proceedings, Part I, of the 6th Asian Conference on Intelligent Information and Database Systems - Volume 8397Erasable itemset mining first introduced in 2009 is an interesting variation of pattern mining. The managers can use the erasable itemsets for planning production plan of the factory. Besides the problem of mining erasable itemsets, the problem of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 149Total Downloads
- Downloads (Last 12 months)25
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in