Mining non-redundant distinguishing subsequence for trip destination forecasting
Authors:
- Mohammad IqbalMIMohammad Iqbal
- Hsing-Kuo PaoHPHsing-Kuo Pao
- 1 January 2021
- journal article
- research article
- Published by Elsevier in Knowledge-Based Systems
- Vol. 211
Abstract
No abstract availableKeywords
Funding Information
- Intel Corporation
- Ministry of Science and Technology, Taiwan (MOST 108-2221-E-011-132)
- Ministry of Science and Technology, Taiwan (109-2221-E-011-127-MY3)
- Ministry of Science and Technology, Taiwan (107-2221-E-011-123)
- Ministry of Science and Technology, Taiwan (105-2633-E-002-001)
- National Taiwan University (NTU-105R104045)
This publication has 10 references indexed in Scilit:
- Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditionsEngineering Applications of Artificial Intelligence, 2018
- Efficient discovery of periodic-frequent patterns in very large databasesJournal of Systems and Software, 2016
- CMRules: Mining sequential rules common to several sequencesKnowledge-Based Systems, 2012
- An effective algorithm for mining sequential generatorsProcedia Engineering, 2011
- Non-redundant sequential rules—Theory and algorithmInformation Systems, 2009
- Frequent Closed Sequence Mining without Candidate MaintenanceIEEE Transactions on Knowledge and Data Engineering, 2007
- Efficient algorithms for mining closed itemsets and their lattice structureIEEE Transactions on Knowledge and Data Engineering, 2005
- Detecting Group Differences: Mining Contrast SetsData Mining and Knowledge Discovery, 2001
- Scalable feature mining for sequential dataIEEE Intelligent Systems and their Applications, 2000
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000