skip to main content
10.1145/1244002.1244103acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Mining and processing category ranking

Published: 11 March 2007 Publication History

Abstract

As more and more data are becoming accessible, a naive retrieval of such data may often result in too many answers, as we commonly call "information overload".

References

[1]
Ronald Fagin. Combining fuzzy information from multiple systems. In PODS, 1996.
[2]
Ronald Fagin, Amnon Lotem, and Moni Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
[3]
Kevin C. Chang and Seung-won Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, 2002.
[4]
Seung-won Hwang. Optimizing ranked retrieval over categorical attributes. In CBMS, 2006.
[5]
Hwanjo Yu, Seung-won Hwang, and Kevin Chang. RankFP: A framework for supporting rank formulation and processing. In ICDE, 2005.
[6]
M. Kendall. Rank Correlation Methods. Hafner, 1955.

Cited By

View all
  • (2015)How to measure similarity for multiple categorical data sets?Multimedia Tools and Applications10.1007/s11042-014-1914-574:10(3489-3505)Online publication date: 1-May-2015
  • (2011)Categorical data skyline using classification treeProceedings of the 13th Asia-Pacific web conference on Web technologies and applications10.5555/1996794.1996818(181-187)Online publication date: 18-Apr-2011
  • (2011)Categorical Data Skyline Using Classification TreeWeb Technologies and Applications10.1007/978-3-642-20291-9_19(181-187)Online publication date: 2011

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '07: Proceedings of the 2007 ACM symposium on Applied computing
March 2007
1688 pages
ISBN:1595934804
DOI:10.1145/1244002
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 March 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. machine learning
  2. top-k query processing

Qualifiers

  • Article

Conference

SAC07
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2015)How to measure similarity for multiple categorical data sets?Multimedia Tools and Applications10.1007/s11042-014-1914-574:10(3489-3505)Online publication date: 1-May-2015
  • (2011)Categorical data skyline using classification treeProceedings of the 13th Asia-Pacific web conference on Web technologies and applications10.5555/1996794.1996818(181-187)Online publication date: 18-Apr-2011
  • (2011)Categorical Data Skyline Using Classification TreeWeb Technologies and Applications10.1007/978-3-642-20291-9_19(181-187)Online publication date: 2011

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media