Chakravarthy SSantra AKomar K(2019)Why Multilayer Networks Instead of Simple Graphs? Modeling Effectiveness and Analysis Flexibility and Efficiency!Big Data Analytics10.1007/978-3-030-37188-3_14(227-244)Online publication date: 12-Dec-2019
https://doi.org/10.1007/978-3-030-37188-3_14
Naughton MStokes NCarthy J(2009)Sentence-level event classification in unstructured textsInformation Retrieval10.1007/s10791-009-9113-013:2(132-156)Online publication date: 11-Sep-2009
https://doi.org/10.1007/s10791-009-9113-0
Dredze MLau TKushmerick NEdmonds ERiecken DParis CSidner C(2006)Automatically classifying emails into activitiesProceedings of the 11th international conference on Intelligent user interfaces10.1145/1111449.1111471(70-77)Online publication date: 29-Jan-2006
https://dl.acm.org/doi/10.1145/1111449.1111471
Show More Cited By

Index Terms

eMailSift: mining-based approaches to email classification
1. Applied computing
  1. Document management and text processing
2. Computing methodologies
  1. Machine learning
    1. Learning paradigms
      1. Unsupervised learning
        Cluster analysis

Recommendations

Efficient algorithms for mining constrained frequent patterns from uncertain data
U '09: Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data

Mining of frequent patterns is one of the popular knowledge discovery and data mining (KDD) tasks. It also plays an essential role in the mining of many other patterns such as correlation, sequences, and association rules. Hence, it has been the subject ...
Real-time stream data mining based on CanTree and Gtree

Proposed algorithm discovers complete frequent itemsets from the stream data.It uses CanTree to store transactions and has an efficient algorithm for sliding-windows.GTree is proposed to find frequent itemsets and serves as a projection-tree.GTree uses ...
Dataless Transitions Between Concise Representations of Frequent Patterns

For many data mining problems in order to solve them it is required to discover frequent patterns. Frequent itemsets are useful e.g. in the discovery of association and episode rules, sequential patterns and clusters. Nevertheless, the number of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGIR '04: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval

July 2004

624 pages

ISBN:1581138814

DOI:10.1145/1008992

General Chair:
Mark Sanderson
University of Sheffield (UK)
,
Program Chairs:
Kalervo Järvelin
University of Tampere (Finland)
,
James Allan
University of Massachusetts (USA)
,
Peter Bruza
Distributed Systems Technology Centre (Australia)

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGIR04

Sponsor:

SIGIR04: The 27th ACM/SIGIR International Symposium on Information Retrieval 2004

July 25 - 29, 2004

Sheffield, United Kingdom

Acceptance Rates

Overall Acceptance Rate 792 of 3,983 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
707
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chakravarthy SSantra AKomar K(2019)Why Multilayer Networks Instead of Simple Graphs? Modeling Effectiveness and Analysis Flexibility and Efficiency!Big Data Analytics10.1007/978-3-030-37188-3_14(227-244)Online publication date: 12-Dec-2019
https://doi.org/10.1007/978-3-030-37188-3_14
Naughton MStokes NCarthy J(2009)Sentence-level event classification in unstructured textsInformation Retrieval10.1007/s10791-009-9113-013:2(132-156)Online publication date: 11-Sep-2009
https://doi.org/10.1007/s10791-009-9113-0
Dredze MLau TKushmerick NEdmonds ERiecken DParis CSidner C(2006)Automatically classifying emails into activitiesProceedings of the 11th international conference on Intelligent user interfaces10.1145/1111449.1111471(70-77)Online publication date: 29-Jan-2006
https://dl.acm.org/doi/10.1145/1111449.1111471
Feng JLiu HZou JEllis AHagino TDouglis FRaghavan P(2005)SAT-MODSpecial interest tracks and posters of the 14th international conference on World Wide Web10.1145/1062745.1062865(1054-1055)Online publication date: 10-May-2005
https://dl.acm.org/doi/10.1145/1062745.1062865

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient algorithms for mining constrained frequent patterns from uncertain data

Real-time stream data mining based on CanTree and Gtree

Dataless Transitions Between Concise Representations of Frequent Patterns