OpenRaiser/Intern-Atlas huggingface dataset:
Learning Belief Networks from Data: An Information Theory Based Approach
Authors: Jie Cheng, David A. Bell, Weiru Liu
Venue: CIKM
Year: 1997

Article Free Access Share on Learning belief networks from data: an information theory based approach Authors: Jie Cheng School of Information and Software Engineering, University of Ulster at Jordanstown, United Kingdom, BT37 0QB School of Information and Software Engineering, University of Ulster at Jordanstown, United Kingdom, BT37 0QBView Profile , David A. Bell School of Information and Software Engineering, University of Ulster at Jordanstown, United Kingdom, BT37 0QB School of Information and Software Engineering, University of Ulster at Jordanstown, United Kingdom, BT37 0QBView Profile , Weiru Liu School of Information and Software Engineering, University of Ulster at Jordanstown, United Kingdom, BT37 0QB School of Information and Software Engineering, University of Ulster at Jordanstown, United Kingdom, BT37 0QBView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 325–331https://doi.org/10.1145/266714.266920Online:01 January 1997Publication History 134citation1,863DownloadsMetricsTotal Citations134Total Downloads1,863Last 12 Months43Last 6 weeks16 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
A Contention Based Dynamic Consistency Maintenance Scheme for Client Cache
Authors: IlYoung Chung, JongMin Lee, Chong-Sun Hwang
Venue: CIKM
Year: 1997

In the client-server database systems, clients can maintain their own cache to reduce the overhead of accessing data objects at server databases. In this case: there should be a protocol which ensures the consistency of cahed data, and it can be divded into two classes: pessimistic protocol and optimistic protocol.
Video Keyframe Extraction and Filtering: A Keyframe is not a Keyframe to Everyone
Authors: Nevenka Dimitrova, Thomas McGee, Herman Elenbaas
Venue: CIKM
Year: 1997

Article Video keyframe extraction and filtering: a keyframe is not a keyframe to everyone Share on Authors: Nevenka Dimitrova Philips Research, 345 Scarborough Rd., Briarcliff Manor NY Philips Research, 345 Scarborough Rd., Briarcliff Manor NYView Profile , Thomas McGee Philips Research, 345 Scarborough Rd., Briarcliff Manor NY Philips Research, 345 Scarborough Rd., Briarcliff Manor NYView Profile , Herman Elenbaas Philips Research, 345 Scarborough Rd., Briarcliff Manor NY Philips Research, 345 Scarborough Rd., Briarcliff Manor NYView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 113–120https://doi.org/10.1145/266714.266876Online:01 January 1997Publication History 28citation1,003DownloadsMetricsTotal Citations28Total Downloads1,003Last 12 Months12Last 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
Real-Time Transactions with Execution Histories: Priority Assignment and Load Control
Authors: Erdogan Dogdu, Gultekin Özsoyoglu
Venue: CIKM
Year: 1997

In this paper, we consider new priority assignment and load control policies for real-time transactions. We assume that execution histories of transactions under different load conditions are available, and propose a number of priority assignment techniques based on execution histories and evaluate them through simulation. A widely used priority assignment technique, Earliest Deadline First, is shown to be biased towards scheduling short transactions favorably. We introduce the notion of "fair scheduling" of transactions in which the goal is to have "similar"success ratios for at1 transaction classes (short to long in sizes).
Pharos: A Scalable Distributed Architecture for Locating Heterogeneous Information Sources
Authors: Ron Dolin, Divyakant Agrawal, Amr El Abbadi, Laura K. Dillon
Venue: CIKM
Year: 1997

Pharos is a .sca&zble distributed architecture for locating heterogeneous informatdon sources. !7he system incorporates a hierarcfiical metaduta structure into a multi-level rettieval system. Queries are resolved through an iterative decisionmaking process. The first step retrieves coarse-grain metadata, about all sources, stored on iocal, mastively replicated, high-level servers. Further steps retrieve more detailed matadata, about a greatly reduced set of souwes, stored on remote, sparsety replicated, topic-based mid-level servers. We present results of a simulation which indicate the feasibility of the architecture. We describe the structure, distribution, and retrieval of the metadata in Pharos to enable users to locate desirable information soumes over the Internet.
Distributed Knowledge Revision/Integration
Authors: Aldo Franco Dragoni, Paolo Giorgini, Paolo Puliti
Venue: CIKM
Year: 1997

We propose a distributed architecture for knowledge revisionintegration, where each element is conceived as a knowledgebased system able to exchange information with the others. since nodes can be affected by some degree of incompetence, part of the information running through the network may be incorrect and might cause contradictions in the knowledge base of some nodes. To manage these contradictions, each node is equipped with a belief revision module which makes it able to discriminate among more or less credible information and more or less reliable information sources. Our aim is that of comparing on a simulation basis the performances and the characteristics of this distributed system vs. those of a centralised architecture. We report here the fmt results of our experiments.
Applications of Approximate Word Matching in Information Retrieval
Authors: James C. French, Allison L. Powell, Eric Schulman
Venue: CIKM
Year: 1997

As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective retrieval of information. The need to discover and reconcile variant forms of strings in bibliographic entries, i.e., authority work, will become more difficult. Spelling variants, misspellings, and transliteration differences will all increase the difficulty of retrieving information. Approximate string matching has traditionally been used to help with this problem. In this paper we introduce the notion of approximate word matching and show how it can be used to improve detection and categorization of variant forms. 1 Introduction There are increasingly more online databases in the current climate of electronic publishing. The challenge is to integrate them into coherent digital libraries that let users have unimpeded access to accurate information. As the pace of electronic publication accelerates there wil...
Assistant for an Information Database
Authors: Michael Früchtl, Jürgen Kreuziger, Michael Beigl
Venue: CIKM
Year: 1997

Article Free Access Share on Assistant for an information database Authors: Michael Früchtl SAP AG Walldorf, Human Resources Management Systems, P.O.Box 1461, 69185 Walldorf, Germany SAP AG Walldorf, Human Resources Management Systems, P.O.Box 1461, 69185 Walldorf, GermanyView Profile , Jürgen Kreuziger SAP AG Walldorf, R/3 Services SAP AG Walldorf, R/3 ServicesView Profile , Michael Beigl Telecooperation Office, Institute of Telematics, University of Karlsruhe, Vincenz-Priessnitz-Strasse 1, 76131 Karlsruhe, Germany Telecooperation Office, Institute of Telematics, University of Karlsruhe, Vincenz-Priessnitz-Strasse 1, 76131 Karlsruhe, GermanyView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 230–237https://doi.org/10.1145/266714.266903Online:01 January 1997Publication History 1citation237DownloadsMetricsTotal Citations1Total Downloads237Last 12 Months8Last 6 weeks2 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
A Corpus Analysis Approach for Automatic Query Expansion
Authors: Susan Gauch, Jianying Wang
Venue: CIKM
Year: 1997

Searching online text collections can be both rewarding and frustrating. While valuable information can be found, typically many irrelevant documents are also retrieved and many relevant ones are missed. Terminology mismatches between the user's query and document contents are a main cause of retrieval failures. Expanding a user's query with related words can improve search performance, but finding and using related words is an open problem. This research uses corpus analysis techniques to automatically discover similar words directly from the contents of the untagged databases. Using these similarities, user queries are automatically expanded, resulting in conceptual retrieval rather than requiring exact word matches between queries and documents. This work has been extended to multi-database collections where each sub-database has a collection-specific similarity matrix associated with it. If the best matrix is selected, substantial search improvements are possible. However, automatically selecting the appropriate matrix for a particular query remains under investigation. * This work was funded by the University of Kansas General Research Fund and National Science Foundation Awards CDA-9401021 and IRI-9409263.
Modeling Temporal Primitives: Back to Basics
Authors: Iqbal A. Goralwalla, Yuri Leontiev, M. Tamer Özsu, Duane Szafron
Venue: CIKM
Year: 1997

Article Modeling temporal primitives: back to basics Share on Authors: Iqbal A. Goralwalla Laboratory for Database Systems Research, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1 Laboratory for Database Systems Research, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1View Profile , Yuri Leontiev Laboratory for Database Systems Research, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1 Laboratory for Database Systems Research, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1View Profile , M. Tamer Özsu Laboratory for Database Systems Research, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1 Laboratory for Database Systems Research, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1View Profile , Duane Szafron Laboratory for Database Systems Research, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1 Laboratory for Database Systems Research, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1View Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 24–31https://doi.org/10.1145/266714.266847Online:01 January 1997Publication History 7citation311DownloadsMetricsTotal Citations7Total Downloads311Last 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
Knowledge Mining from Textual Sources
Authors: Udo Hahn, Klemens Schnattinger
Venue: CIKM
Year: 1997

WC propose a new, knowledge-based methodology for deep knowledge discovery from natural language documents. Data mining, data interpretation, and data cleaning are all incorporated in a terminological reasoning process. We exploit qualitative knowledge about linguistic phenomena in naturaI languagetexts and structural configurations in text and domain knowledge bases to generate concept hypotheses, rank them according to plausibility, and select the most credible ones for knowledge assimilation.
The Update of Index Structures in Object-Oriented DBMS
Authors: Andreas Henrich
Venue: CIKM
Year: 1997

Index structures in object-oriented database management systems should support selections not only with respect to physical object attributes, but also with respect to derived attributes. A simple example arises, if we assume the object types Company , Division,andEmployee, with the relationships has division from Company to Division,andemploys from Division to Employee. In this case the index structure should allow to support queries for companies specifying the number of employees of the company. Unfortunately, there is one main problem with index structures addressing derived attributes, namely the question: Which entries in which index structures have to be updated after a certain update in the object base? In the example above, the creation of a new employee must trigger an index update for the corresponding company. In the present paper we propose a practical solution for this problem. This solution is based on so-called index update definitions which comprise (1) an event desc...
A Framework for the Management of Past Experiences with Time-Extended Situations
Authors: Michel Jaczynski
Venue: CIKM
Year: 1997

: In the context of knowledge management, we focus on the representation and the retrieval of past experiences called cases within the Case-Based Reasoning (CBR) paradigm. CBR is a problem-solving method based on the reuse of past experiences that represent pieces of knowledge. The first step of this kind of reasoning is the retrieval from the memory of relevant cases to solve a new problem by reuse and adaptation. In this paper, we propose a framework to be used in the design of CBR systems that need a retrieval of cases with timeextended situations. Time-extended situation assessment is required in many different applications such as automatic control, medical problem solving, process supervision and forecasting. Inside our framework for past experiences management, we propose a representation model that mainly handles situations described by a set of sequences of events and/or sampled data. We also propose a complex retrieval strategy that integrates the retrieval of different type...
View Materialization Techniques for Complex Hierarchical Objects
Authors: Matthew C. Jones, Elke A. Rundensteiner
Venue: CIKM
Year: 1997

In many design applications, it is common practice to store corn-pfex hierarchical objects in a compactfolded form to save storage space and to reduce processing costs for accessing the objects. In these folded representations, complex objects are built up from identical and otherwise indistinguishable objects. Howevec it is o&en necessary, especially during the refinement of data, to distinguish between these identicul forCtd objects by personakkg a subset of them. The established practice is IO eqficitfy unfold the hierarchical objects and thus create space in which to store distinct personalization data for each object occurrence. However, this explicit unfolding is costly and time consuming, resulting in a potentiaZfy much larger structure, and substantially increasing the costs of querying and updating the design. Therefore, we propose an unfold operator that supports access to data in a virtua& Unfolded view. We describe how to updare customized values for each hierarchical sub-object through the unfolded view. We propose alternative strategies for the maintenance of personalization values, representing various portions of the view materialization spectrutn. We present a performance evaluation comparing these strategies as well as the traditional explicit unfolding approach.
Incorporating Association Pattern and Operation Specification in ODMG's OQL
Authors: Vanja Josifovski, Stanley Y. W. Su
Venue: CIKM
Year: 1997

Article Incorporating association pattern and operation specification in ODMG's OQL Share on Authors: Vanja Josifovski Department of Computer and Information Science, Linköping University, S-581 83 Linköping, Sweden and Database Research and Development Center, University of Florida Department of Computer and Information Science, Linköping University, S-581 83 Linköping, Sweden and Database Research and Development Center, University of FloridaView Profile , Stanley Y. W. Su Database Research and Development Center, University of Florida Database Research and Development Center, University of FloridaView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 332–340https://doi.org/10.1145/266714.266921Published:01 January 1997 0citation260DownloadsMetricsTotal Citations0Total Downloads260Last 12 Months0Last 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
Conceptual Analysis of Hypertext
Authors: Robert E. Kent, Christian Neuss
Venue: CIKM
Year: 1997

In this chapter tools and techniques from the mathematical theory of formal concept analysis are applied to hypertext systems in general, and the World Wide Web in particular. Various processes for the conceptual structuring of hypertext are discussed: summarization, conceptual scaling, and the creation of conceptual links. Well-known interchange formats for summarizing networked information resources as resource meta-information are reviewed, and two new interchange formats originating from formal concept analysis are advocated. Also reviewed is conceptual scaling, which provides a principled approach to the faceted analysis techniques in library science classification. The important notion of conceptual linkage is introduced as a generalization of a hyperlink. The automatic hyperization of the content of legacy data is described, and the composite conceptual structuring with hypertext linkage is defined. For the conceptual empowerment of the Web user, a new technique called conceptual browsing is advocated. Conceptual browsing, which browses over conceptual links, is dual mode (both extensional and intensional) and dual scope (both global and local).
Using Consistency-driven Pairwise Comparisons in Knowledge-based Systems
Authors: Waldemar W. Koczkodaj, Michael W. Herman, Marian Orlowski
Venue: CIKM
Year: 1997

Knowledge acquisition often requires the assessment of qualitative stimuli (e.g., criteria or priorities) such as public safety or the degree of environmental damage. Weights, reflecting the relative importance of the objectives concerned are one of the most commonly used solutions for this kind of data. Subjective judgments involve inaccuracy (which is difficult to control) and consistency of judgments (which can be measured and used to influence the accuracy). The consistency-driven pairwise comparisons method is based on an inconsistency index and its use as a validation technique. Knowledge acquisition using the consistency-driven pairwise comparisons method, when supported by properly designed software, contributes to the improvement of the quality of knowledge-based systems.
Reducing Match Time Variance in Production Systems with HAL
Authors: Pou-yung Lee, Albert Mo Kim Cheng
Venue: CIKM
Year: 1997

Article Reducing match time variance in production systems with HAL Share on Authors: Pou-yung Lee Real-Time Systems Laboratory, Department of Computer Science, University of Houston - University Park, Houston, Texas Real-Time Systems Laboratory, Department of Computer Science, University of Houston - University Park, Houston, TexasView Profile , Albert Mo Kim Cheng Real-Time Systems Laboratory, Department of Computer Science, University of Houston - University Park, Houston, Texas Real-Time Systems Laboratory, Department of Computer Science, University of Houston - University Park, Houston, TexasView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 309–316https://doi.org/10.1145/266714.266916Online:01 January 1997Publication History 2citation211DownloadsMetricsTotal Citations2Total Downloads211Last 12 Months2Last 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 Uniform Approach to Global Concurrency Control and Recovery in Multidatabase Environment
Authors: SangKeun Lee, Chong-Sun Hwang, Won-Gyu Lee
Venue: CIKM
Year: 1997

In this paper, we provide a uniform approach to global con-' currency control and recovery in multidatabase environment.
Experimental Evaluation of PFS Continuous Media File System
Authors: Wonjun Lee, Difu Su, Duminda Wijesekera, Jaideep Srivastava, Deepak R. Kenchammana-Hosekote, Mark Foresti
Venue: CIKM
Year: 1997

Article Experimental evaluation of PFS continuous media file system Share on Authors: Wonjun Lee Department of Computer Science, University of Minnesota, Minneapolis, MN Department of Computer Science, University of Minnesota, Minneapolis, MNView Profile , Difu Su Department of Computer Science, University of Minnesota, Minneapolis, MN Department of Computer Science, University of Minnesota, Minneapolis, MNView Profile , Duminda Wijesekera Department of Computer Science, University of Minnesota, Minneapolis, MN Department of Computer Science, University of Minnesota, Minneapolis, MNView Profile , Jaideep Srivastava Department of Computer Science, University of Minnesota, Minneapolis, MN Department of Computer Science, University of Minnesota, Minneapolis, MNView Profile , Deepak Kenchammana-Hosekote IBM Almaden Research Center, San Hose CA IBM Almaden Research Center, San Hose CAView Profile , Mark Foresti Rome Laboratory, Griffs Air Force Base, Rome NY Rome Laboratory, Griffs Air Force Base, Rome NYView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 246–253https://doi.org/10.1145/266714.266905Published:01 January 1997 8citation342DownloadsMetricsTotal Citations8Total Downloads342Last 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 SiteGet Access