ACM Home Page
Please provide us with feedback. Feedback
Small is beautiful: discovering the minimal set of unexpected patterns
Full text PdfPdf (107 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Boston, Massachusetts, United States
Pages: 54 - 63  
Year of Publication: 2000
ISBN:1-58113-233-6
Authors
Balaji Padmanabhan  The Wharton School, University of Pennsylvania, 1310 Steinberg-Dietrich Hall, Philadelphia, PA
Alexander Tuzhilin  Stern School of Business, New York University, 44 West 4lt;supgt;thlt;/supgt; Street, New York, NY
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
AAAI : Am Assoc for Artifical Intelligence
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 68,   Citation Count: 33
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/347090.347103
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
Bayardo, R., Agrawal, R. and Gunopulos, D., 1999. Constraint-Based Rule Mining in Large, Dense Databases. In Proceedings of ICDE, 1999.
 
4
Berger, G. and Tuzhilin, A., 1998. Discovering Unexpected Patterns in Temporal Data Using Temporal Logic. In Etzion, O., Jajodia, S. and Sripada, S. eds, Temporal Databases: Research and Practice. Springer, 1998.
 
5
 
6
Liu, B. and Hsu, W., 1996. Post-Analysis of Learned Rules. In Proc. of the Thirteenth National Conference on Artificial Intelligence (AAAI '96), pp. 828-834.
 
7
Liu, B., Hsu, W. and Chen, S, 1997. Using General Impressions to Analyze Discovered Classification Rules. In Proc. of the Third International Conference on Knowledge Discovery and Data Mining (KDD 97), pp. 31-36.
8
 
9
Mitchell, T., 1982. Generalization as Search. Artificial Intelligence, pp. 203-226.
 
10
 
11
Padmanabhan, B. and Tuzhilin, A., 1998. "A Belief-Driven Method for Discovering Unexpected Patterns." In Proc. 4th Int'l Conf. on Know. Discovery and Data Mining, 1998.
 
12
 
13
Suzuki, E., 1997. Autonomous Discovery of Reliable Exception Rules. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pp. 259-262.
 
14
Subramonian, R. Defining diff as a data mining primitive. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, 1998.
15
 
16
Shah, D., Lakshmanan, L.V.S, Ramamritham, K., and Sudarshan, S., 1999. Interestingness and Pruning of Mined Patterns. In Proceedings of the 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), Philadelphia, 1999.
 
17
Silberschatz, A. and Tuzhilin, A., 1995. On Subjective Measures of Interestingness in Knowledge Discovery. In Proc. of the First International Conference on Knowledge Discovery and Data Mining, pp. 275-281.
 
18
 
19
Srikant, R., Vu, Q. and Agrawal, R. Mining Association Rules with Item Constraints. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD 97), pp. 67-73.
 
20
Toivonen, H., Klemetinen, M., Ronkainen, P., Hatonen, K. and Mannila, H., 1995. Pruning and Grouping Discovered Association Rules. In MLNet Workshop on Statistics, Machine Learning and Discovery in Databases, pp. 47-52.

CITED BY  33

Collaborative Colleagues:
Balaji Padmanabhan: colleagues
Alexander Tuzhilin: colleagues