Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleOctober 2001
Ordinal association rules for error identification in data sets
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementPages 589–591https://doi.org/10.1145/502585.502700A new extension of the Boolean association rules, ordinal association rules, that incorporates ordinal relationships among data items, is introduced. One use for ordinal rules is to identify possible errors in data. A method that finds these rules and ...
- ArticleOctober 2001
Irregularity in multi-dimensional space-filling curves with applications in multimedia databases
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementPages 512–519https://doi.org/10.1145/502585.502671A space-filling curve is a way of mapping the multi-dimensional space into the one-dimensional space. It acts like a thread that passes through every cell element (or pixel) in the N-dimensional space so that every cell is visited at least once. Thus, a ...
- ArticleOctober 2001
Finding similar images quicky using object shapes
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementPages 498–506https://doi.org/10.1145/502585.502669Retrieving images from a large image collection has been an active area of research. Most of the existing works have focused on content representation. In this paper, we address the issue of identifying relevant images quickly. This is important in ...
- ArticleOctober 2001
SVM binary classifier ensembles for image classification
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementPages 395–402https://doi.org/10.1145/502585.502652We study how the SVM-based binary classifiers can be effectively combined to tackle the multi-class image classification problem. We study several ensemble schemes, including OPC (one per class), PWC (pairwise coupling), and ECOC (error-correction ...
- ArticleOctober 2001
Dynamic and hierarchical spatial access method using integer searching
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementPages 341–348https://doi.org/10.1145/502585.502643Dynamic and complex computation in the area of Geographic Information System (GIS) or Mobile Computing System involves huge amount of spatial objects such as points, boxes, polygons, etc and requires a scalable data structure and an efficient management ...
- ArticleOctober 2001
Managing trust in a peer-2-peer information system
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementPages 310–317https://doi.org/10.1145/502585.502638Managing trust is a problem of particular importance in peer-to-peer environments where one frequently encounters unknown agents. Existing methods for trust management, that are based on reputation, focus on the semantic properties of the trust model. ...
- ArticleOctober 2001
Predicting the cost-quality trade-off for information retrieval queries: facilitating database design and query optimization
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementPages 207–214https://doi.org/10.1145/502585.502621Efficient, flexible, and scalable integration of full text information retrieval (IR) in a DBMS is not a trivial case. This holds in particular for query optimization in such a context. To facilitate the bulk-oriented behavior of database query ...
- ArticleOctober 2001
Mining confident rules without support requirement
CIKM '01: Proceedings of the tenth international conference on Information and knowledge managementPages 89–96https://doi.org/10.1145/502585.502601An open problem is to find all rules that satisfy a minimum confidence but not necessarily a minimum support. Without the support requirement, the classic support-based pruning strategy is inapplicable. The problem demands a confidence-based pruning ...