SIGN IN
SIGN UP
Discovering all most specific sentences
Full Text:
Pdf
Buy this Article
Authors:
Dimitrios Gunopulos
Computer Science and Engineering Department, University of California, Riverside, CA
Roni Khardon
EECS Department, Tufts University, Medford, MA
Heikki Mannila
Department of Computer Science, University of Helsinki, Helsinki, Finland
Sanjeev Saluja
LSI Logic, Milpitas, CA
Hannu Toivonen
Department of Computer Science, University of Helsinki, Helsinki, Finland
Ram Sewak Sharma
Computer Science and Engineering Department, University of California, Riverside, CA
2003 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 25
· Downloads (cumulative): 1,283
· Citation Count: 54
Published in:
· Journal
ACM Transactions on Database Systems (TODS)
TODS Homepage
archive
Volume 28 Issue 2, June 2003
Pages 140 - 174
ACM
New York, NY
, USA
table of contents
doi>
10.1145/777943.777945
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
association rules
data mining
learning with membership queries
maximal frequent sets
minimal keys
search process
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder
Feedback
|
Switch to single page view (no tabs)
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
Buy this Article
2003 Article
