OpenRaiser/Intern-Atlas huggingface dataset:
An Efficient Hierarchical Scheme for Locating Highly Mobile Users
Authors: Evaggelia Pitoura, Ioannis Fudos
Venue: CIKM
Year: 1998

To accommodate the increase in user population in future personal communication systems, hierarchical architectures of location databases have been proposed. In this paper, a scheme based on forwarding pointers is presented, that reduces the cost of the overall network and database traffic generated by frequent location updates in such hierarchical architectures. To reduce the number of forwarding pointers that need to be traversed to locate a user, auxiliary caching techniques are presented. Various conditions for purging the chain of forwarding pointers and updating the database are also introduced. Special care is given so that the scheme correctly supports the concurrent execution of updates and lookups. The applicability of the scheme and the performance of the caching techniques are demonstrated through a number of experiments for a range of call to mobility ratios and for a variety of moving and calling behaviors. 1 Introduction Advances in wireless telecommunications and in t...
Selectivity Estimation of Window Queries
Authors: Guido Proietti, Christos Faloutsos
Venue: CIKM
Year: 1998

Despite of the fact that large line segment datasets are becoming more and more popular, most of the analysis for estimating the selectivity of window queries posed on spatial data --the most important parameter for query optimization-- has focused on point or region data only. In this paper we move one significant step forward in line segment datasets theoretical analysis. We discovered that real lines closely follow a distribution law, that we named the SLED law (Segment LEngth Distribution). The SLED law can be used for an accurate estimation of the selectivity of window queries. Experiments on a variety of real line segment datasets (hydrographic systems, roadmaps, railroads, utilities networks) show that our law holds and that our formula is extremely accurate, enjoying a maximum relative error of 4% in estimating the selectivity. 1 On leave from Dipartimento di Matematica Pura ed Applicata, University of L&apos;Aquila, Via Vetoio, I-67010, Italy. His research was partially supported ...
Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales
Authors: Yunyao Qu, Changzhou Wang, Xiaoyang Sean Wang
Venue: CIKM
Year: 1998

An important investigation of time series involves searching for &quot;movement&quot; patterns, such as &quot;going up&quot; or &quot;going down&quot; or some combinations of them. Movement patterns can be in various scales: a large scale pattern may cover a long time period, while a small scale pattern usually covers a short time period. This paper considers such scale requirement. More specifically, a pattern is defined as a regular expression of letters, where each letter describes a movement direction and covers a specified length of time (called pattern unit length). To find if a time series (or a part of it) matches a pattern, the time series is first partitioned into consecutive sub-series of the unit length, and for each subseries, the direction of its best fitting line is taken as the movement direction of the sub-series if the distance between the best fitting line and the sub-series is within a specified tolerance (tolerance requirement). A direct implementation of pattern search will undoubtedly yield poor performance if the number of time series or the length of them is large. This paper introduces a pre-computation and indexing method to facilitate fast evaluation of pattern queries in user-specified scales. An efficient pre-computation algorithm is given to find the movement directions for all the sub-series that satisfy the tolerance requirement. Bounding triangles are used to represent clusters of sub-series. Relational database is then used to store these bounding triangles and relational operations are employed to facilitate the evaluation of pattern queries. The paper also reports some experiments performed on a real-life data set to show the efficiency and the scalability of the algorithms.
Accurate User Directed Summarizatiion from Existing Tools
Authors: Mark Sanderson
Venue: CIKM
Year: 1998

This paper describes a set of experimental\nresults produced from the TIPSTER\nSUMMAC initiative on user directed\nsummaries: document summaries generated in\nthe context of an information need expressed\nas a query. The summarizer that was\nevaluated was based on a set of existing\nstatistical techniques that had been applied\nsuccessfully to the INQUERY retrieval system.\nThe techniques proved to have a wider utility,\nhowever, as the summarizer was one of the\nbetter performing systems in the SUMMAC\nevaluation. The design of this summarizer is\npresented with a range of evaluations: both\nthose provided by SUMMAC as well as a set of\npreliminary, more informal, evaluations that\nexamined additional aspects of the summaries.\nAmongst other conclusions, the results reveal\nthat users can judge the relevance of\ndocuments from their summary almost as\naccurately as if they had had access to the\ndocument’s full text.
An Incremental Approach to Schema Integration by Refining Extensional Relationships
Authors: Ingo Schmitt, Can Türker
Venue: CIKM
Year: 1998

Article An incremental approach to schema integration by refining extensional relationships Share on Authors: Ingo Schmitt Otto-von-Guericke-Universität Magdeburg, Institut für Technische und Betriebliche Informationssysteme, Postfach 4120, D-39016 Magdeburg, Germany Otto-von-Guericke-Universität Magdeburg, Institut für Technische und Betriebliche Informationssysteme, Postfach 4120, D-39016 Magdeburg, GermanyView Profile , Can Türker Otto-von-Guericke-Universität Magdeburg, Institut für Technische und Betriebliche Informationssysteme, Postfach 4120, D-39016 Magdeburg, Germany Otto-von-Guericke-Universität Magdeburg, Institut für Technische und Betriebliche Informationssysteme, Postfach 4120, D-39016 Magdeburg, GermanyView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 322–330https://doi.org/10.1145/288627.288673Online:01 November 1998Publication History 3citation356DownloadsMetricsTotal Citations3Total Downloads356Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Modeling Time from a Conceptual Perspective
Authors: Stefano Spaccapietra, Christine Parent, Esteban Zimányi
Venue: CIKM
Year: 1998

Although many temporal models have been proposed in the literature, there is still need for a conceptual model capturing the essential semantics of time-varying information that is free of implementation concerns. This paper first discusses important criteria to be considered when assessing the “conceptual” quality of a temporal model. Then, it presents the main temporal features of MADS, a spatiotemporal conceptual model. The focus is on identifying issues that are either open or controversial, and discussing alternatives, if any. Finally, it is shown how the model may be implemented on top of either TSQL2 or a traditional, non-temporal data model. 1.1 Keywords Temporal databases, conceptual modeling, data semantics
Just-In-Time Databases and the World-Wide Web
Authors: Ellen Spertus, Lynn Andrea Stein
Venue: CIKM
Year: 1998

Article Free Access Share on Just-in-time databases and the World-Wide Web Authors: Ellen Spertus Mills College, 5000 MacArthur Blvd, Oakland, CA Mills College, 5000 MacArthur Blvd, Oakland, CAView Profile , Lynn Andrea Stein MIT AI Lab, 545 Technology Square, Cambridge, MA MIT AI Lab, 545 Technology Square, Cambridge, MAView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 30–37https://doi.org/10.1145/288627.288638Online:01 November 1998Publication History 3citation310DownloadsMetricsTotal Citations3Total Downloads310Last 12 Months13Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Using Incremental Pruning to Increase the Efficiency of Dynamic Itemset Counting for Association Rules
Authors: Jian Tang
Venue: CIKM
Year: 1998

Article Free Access Share on Using incremental pruning to increase the efficiency of dynamic itemset counting for mining association rules Author: Jian Tang Department of Computer Science, Memorial University of Newfoundland, St. John's Newfoundland, A1B 3X5 Canada Department of Computer Science, Memorial University of Newfoundland, St. John's Newfoundland, A1B 3X5 CanadaView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998Pages 273–280https://doi.org/10.1145/288627.288667Published:01 November 1998Publication History 0citation347DownloadsMetricsTotal Citations0Total Downloads347Last 12 Months50Last 6 weeks13 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Clustering and Singular Value Decomposition for Approximate Indexing in High Dimensional Spaces
Authors: Alexander Thomasian, Vittorio Castelli, Chung-Sheng Li
Venue: CIKM
Year: 1998

High-dimensionality indexing of feature spaces is critical for many data-intensive applications such as content-based retrieval of images or video from multimedia databases and similarity retrieval of patterns in data mining. Unfortunately, the performance of nearest neighbor (NN) queries, which are required for similarity search, deteriorates rapidly with the increase in the number of dimensions. We propose the Clustering with Singular Value Decomposition (CSVD) method, which combines clustering and singular value decomposition (SVD) to reduce the numb e r o f i n d e x d i m e nsions, while maintaining a reasonably high precision for a given value of recall. In the proposed CSVD method, homogeneous points are grouped into clusters such that the points in each cluster are more amenable to dimensionality reduction than the original dataset. Experiments with texture vectors extracted from satellite images show that CSVD achieves signi cantly higher dimensionality reduction than SVD for the same fraction of total variance preserved. Conversely, for the same compression ratio CSVD results in an increase in preserved total variance with respect to SVD (e.g., a 70% increase for a 20:1 compression ratio). This translates to a higher e ciency in processing approximate NN queries, as quanti ed through experimental results.
BROOM: Buffer Replacement using Online Optimization by Mining
Authors: Anthony K. H. Tung, Y. C. Tay, Hongjun Lu
Venue: CIKM
Year: 1998

Article BROOM: buffer replacement using online optimization by mining Share on Authors: Anthony K. H. Tung Dept. of Computer Science, National Univ. of Singapore Dept. of Computer Science, National Univ. of SingaporeView Profile , Y. C. Tay Dept. of Mathematics, National Univ. of Singapore Dept. of Mathematics, National Univ. of SingaporeView Profile , Hongjun Lu Dept. of Computer Science, National Univ. of Singapore Dept. of Computer Science, National Univ. of SingaporeView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 185–192https://doi.org/10.1145/288627.288656Online:01 November 1998Publication History 5citation261DownloadsMetricsTotal Citations5Total Downloads261Last 12 Months5Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Data Cube Approximation and Histograms via Wavelets
Authors: Jeffrey Scott Vitter, Min Wang, Balakrishna R. Iyer
Venue: CIKM
Year: 1998

Article Free Access Share on Data cube approximation and histograms via wavelets Authors: Jeffrey Scott Vitter Center for Geometric Computing and Department of Computer Science, Duke University, Durham, NC Center for Geometric Computing and Department of Computer Science, Duke University, Durham, NCView Profile , Min Wang Center for Geometric Computing and Department of Computer Science, Duke University, Durham, NC Center for Geometric Computing and Department of Computer Science, Duke University, Durham, NCView Profile , Bala Iyer Database Technology Institute, IBM Santa Teresa Laboratory, P.O. Box 49023, San Jose, CA Database Technology Institute, IBM Santa Teresa Laboratory, P.O. Box 49023, San Jose, CAView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 96–104https://doi.org/10.1145/288627.288645Online:01 November 1998Publication History 169citation593DownloadsMetricsTotal Citations169Total Downloads593Last 12 Months34Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Associated Biological Information Retrieval from Distributed Databases
Authors: Mousheng Xu, Susan Gauch
Venue: CIKM
Year: 1998

Article Associated biological information retrieval from distributed databases Share on Authors: Mousheng Xu Department of Electrical Engineering and Computer Science, University of kansas, Lawrence, KS Department of Electrical Engineering and Computer Science, University of kansas, Lawrence, KSView Profile , Susan Gauch Department of Electrical Engineering and Computer Science, University of kansas, Lawrence, KS Department of Electrical Engineering and Computer Science, University of kansas, Lawrence, KSView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 193–200https://doi.org/10.1145/288627.288657Online:01 November 1998Publication History 1citation725DownloadsMetricsTotal Citations1Total Downloads725Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
A New On-Line Learning Algorithm for Adaptive Text Filtering
Authors: Kwok Leung Yu, Wai Lam
Venue: CIKM
Year: 1998

Article Free Access Share on A new on-line learning algorithm for adaptive text filtering Authors: Kwok Leung Yu Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong KongView Profile , Wai Lam Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong KongView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 156–160https://doi.org/10.1145/288627.288652Online:01 November 1998Publication History 5citation241DownloadsMetricsTotal Citations5Total Downloads241Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Dynamic Restructuring of Transactional Workflow Activities: A Practical Implementation Method
Authors: Tong Zhou, Calton Pu, Ling Liu
Venue: CIKM
Year: 1998

Article Free Access Share on Dynamic restructuring of transactional workflow activities: a practical implementation method Authors: Tong Zhou Department of Computer Science & Engineering, Oregon Graduate Institute, P.O.Box 91000, Portland, OR Department of Computer Science & Engineering, Oregon Graduate Institute, P.O.Box 91000, Portland, ORView Profile , Calton Pu Department of Computer Science & Engineering, Oregon Graduate Institute, P.O.Box 91000, Portland, OR Department of Computer Science & Engineering, Oregon Graduate Institute, P.O.Box 91000, Portland, ORView Profile , Ling Liu Department of Computer Science & Engineering, Oregon Graduate Institute, P.O.Box 91000, Portland, OR Department of Computer Science & Engineering, Oregon Graduate Institute, P.O.Box 91000, Portland, ORView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 378–385https://doi.org/10.1145/288627.288683Online:01 November 1998Publication History 6citation301DownloadsMetricsTotal Citations6Total Downloads301Last 12 Months4Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Haystack: Per-User Information Environments
Authors: Eytan Adar, David R. Karger, Lynn Andrea Stein
Venue: CIKM
Year: 1999

Traditional Information Retrieval (IR) systems are designed to provide uniform access to centralized corpora by large numbers of people. The Haystack project emphasizes the relationship between a particular individual and his corpus. An individual's own haystack priviliges information with which that user interacts, gathers data about those interactions, and uses this metadata to further personalize the retrieval process. This paper describes the prototype Haystack system.
Metadata and Data Structures for the Historical Newspaper Digital Library
Authors: Robert B. Allen, John Schalow
Venue: CIKM
Year: 1999

We examine metadata and data-structure issues for the Historical Newspaper Digital Library. This project proposes to digitize and then do OCR and linguisting processing on several years worth of historical newspapers. Newspapers are very complex information objects so developing a rich description of their content is challenging. In addition to frameworks for the logical structure and physical layout, we propose metadata relevant to the image processing and to the historians who will use this collection. Finally, we consider how the metadata infrastructure might be managed as it evolves with improved text processing capabilities and how an infrastructure might be developed to support a community of users.
A Learning Approach to Processor Allocation in Parallel Systems
Authors: Amy W. Apon, Thomas D. Wagner, Lawrence W. Dowdy
Venue: CIKM
Year: 1999

Given a typical parallel system and a collection of applications that are to execute on the system, a common problem is determining an effective allocation of processors among the applications. In this paper a learning approach is applied to processor allocation. The approach is to use a stochastic learning automaton (SLA) as a decision tool. An SLA uses values of the current state description, makes an allocation decision, evaluates its decision at some later time, modifies its decision making process, and tries to find the best allocation strategy by learning from its previous mistakes. The method is applied to the problem of allocating processors to parallel applications in a distributed system such as a cluster of workstations, and is validated through simulation. The result of this study show that a learning approach that utilizes a stochastic learning automaton is effective at making processor allocation decisions in a parallel system.
Archiving Telemeetings
Authors: Constantin Arapis
Venue: CIKM
Year: 1999

This paper presents a prototype system for modeling and managing the complete life-time of telemeetings/teleconferences. The system provides services for modeling telemeetings, storing telemeetings in a telemeeting database, annotating telemeetings and querying the telemeeting database.
Incremental Encoding of Multiple Inheritance Hierarchies
Authors: Martin F. van Bommel, T. J. Beck
Venue: CIKM
Year: 1999

Incremental updates to multiple inheritance hierarchies are becoming more prevalent with the increasing number of persistent applications supporting complex objects, making the efficient computation of lattice operations such as greatest lower bound (GLB), least upper bound (LUB), and subsumption more and more important. General techniques for the compact encoding of a hierarchy are presented. One such method is to plunge the given ordering into a boolean lattice of binary words, leading to an almost constant-time complexity of the lattice operations. The method is based on an inverted version of the encoding of Ait-Kaci et al. to allow incremental update. Simple grouping is used to reduce the code space while keeping the lattice operations efficient. Comparisons are made to an incremental version of the range compression scheme of Agrawal et al., where each class is assigned an interval, and relationships are based on containment in the interval. The result is two encoding methods which have their relative merits. The former being better for smaller, more structured hierarchies, and the latter for larger, less organized hierarchies.