Mining Top-Rank-k Erasable Itemsets by PID_lists
Article first published online: 14 JAN 2013
© 2013 Wiley Periodicals, Inc.
International Journal of Intelligent Systems
Volume 28, Issue 4, pages 366–379, April 2013
How to Cite
Deng, Z. (2013), Mining Top-Rank-k Erasable Itemsets by PID_lists. Int. J. Intell. Syst., 28: 366–379. doi: 10.1002/int.21580
- Issue published online: 14 FEB 2013
- Article first published online: 14 JAN 2013
- National High Technology Research and Development Program of China. Grant Number: 2009AA01Z136
- National Natural Science Foundation of China. Grant Number: 90812001
Options for accessing this content:
- If you are a society or association member and require assistance with obtaining online access instructions please contact our Journal Customer Services team.
- If your institution does not currently subscribe to this content, please recommend the title to your librarian.
- Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
- You can purchase online access to this Article for a 24-hour period (price varies by title)
- If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
- New Users: Please register, then proceed to purchase the article.
Login via OpenAthens
Search for your institution's name below to login via Shibboleth.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!