id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0108004 | Links tell us about lexical and semantic Web content | cs.IR cs.DL | The latest generation of Web search tools is beginning to exploit hypertext
link information to improve ranking\cite{Brin98,Kleinberg98} and
crawling\cite{Menczer00,Ben-Shaul99etal,Chakrabarti99} algorithms. The hidden
assumption behind such approaches, a correlation between the graph structure of
the Web and its con... |
cs/0108005 | A Bit of Progress in Language Modeling | cs.CL | In the past several years, a number of different language modeling
improvements over simple trigram models have been found, including caching,
higher-order n-grams, skipping, interpolated Kneser-Ney smoothing, and
clustering. We present explorations of variations on, or of the limits of, each
of these techniques, inc... |
cs/0108006 | Classes for Fast Maximum Entropy Training | cs.CL | Maximum entropy models are considered by many to be one of the most promising
avenues of language modeling research. Unfortunately, long training times make
maximum entropy research difficult. We present a novel speedup technique: we
change the form of the model to use classes. Our speedup works by creating two
maxim... |
cs/0108008 | Using Methods of Declarative Logic Programming for Intelligent
Information Agents | cs.MA cs.AI | The search for information on the web is faced with several problems, which
arise on the one hand from the vast number of available sources, and on the
other hand from their heterogeneity. A promising approach is the use of
multi-agent systems of information agents, which cooperatively solve advanced
information-retr... |
cs/0108009 | Artificial Neurons with Arbitrarily Complex Internal Structures | cs.NE q-bio.NC | Artificial neurons with arbitrarily complex internal structure are
introduced. The neurons can be described in terms of a set of internal
variables, a set activation functions which describe the time evolution of
these variables and a set of characteristic functions which control how the
neurons interact with one ano... |
cs/0108011 | On Classes of Functions for which No Free Lunch Results Hold | cs.NE math.OC nlin.AO | In a recent paper it was shown that No Free Lunch results hold for any subset
F of the set of all possible functions from a finite set X to a finite set Y
iff F is closed under permutation of X. In this article, we prove that the
number of those subsets can be neglected compared to the overall number of
possible subs... |
cs/0108013 | Convergent Approximate Solving of First-Order Constraints by Approximate
Quantifiers | cs.LO cs.AI | Exactly solving first-order constraints (i.e., first-order formulas over a
certain predefined structure) can be a very hard, or even undecidable problem.
In continuous structures like the real numbers it is promising to compute
approximate solutions instead of exact ones. However, the quantifiers of the
first-order p... |
cs/0108018 | Bipartite graph partitioning and data clustering | cs.IR cs.LG | Many data types arising from data mining applications can be modeled as
bipartite graphs, examples include terms and documents in a text corpus,
customers and purchasing items in market basket analysis and reviewers and
movies in a movie recommender system. In this paper, we propose a new data
clustering method based... |
cs/0108022 | Portability of Syntactic Structure for Language Modeling | cs.CL | The paper presents a study on the portability of statistical syntactic
knowledge in the framework of the structured language model (SLM). We
investigate the impact of porting SLM statistics from the Wall Street Journal
(WSJ) to the Air Travel Information System (ATIS) domain. We compare this
approach to applying the ... |
cs/0108023 | Information Extraction Using the Structured Language Model | cs.CL cs.IR | The paper presents a data-driven approach to information extraction (viewed
as template filling) using the structured language model (SLM) as a statistical
parser. The task of template filling is cast as constrained parsing using the
SLM. The model is automatically trained from a set of sentences annotated with
frame... |
cs/0109006 | On Properties of Update Sequences Based on Causal Rejection | cs.AI | We consider an approach to update nonmonotonic knowledge bases represented as
extended logic programs under answer set semantics. New information is
incorporated into the current knowledge base subject to a causal rejection
principle enforcing that, in case of conflicts, more recent rules are preferred
and older rule... |
cs/0109010 | Anaphora and Discourse Structure | cs.CL | We argue in this paper that many common adverbial phrases generally taken to
signal a discourse relation between syntactically connected units within
discourse structure, instead work anaphorically to contribute relational
meaning, with only indirect dependence on discourse structure. This allows a
simpler discourse ... |
cs/0109013 | Conceptual Analysis of Lexical Taxonomies: The Case of WordNet Top-Level | cs.CL cs.IR | In this paper we propose an analysis and an upgrade of WordNet's top-level
synset taxonomy. We briefly review WordNet and identify its main semantic
limitations. Some principles from a forthcoming OntoClean methodology are
applied to the ontological analysis of WordNet. A revised top-level taxonomy is
proposed, which... |
cs/0109014 | Assigning Satisfaction Values to Constraints: An Algorithm to Solve
Dynamic Meta-Constraints | cs.PL cs.AI | The model of Dynamic Meta-Constraints has special activity constraints which
can activate other constraints. It also has meta-constraints which range over
other constraints. An algorithm is presented in which constraints can be
assigned one of five different satisfaction values, which leads to the
assignment of domai... |
cs/0109015 | Boosting Trees for Anti-Spam Email Filtering | cs.CL | This paper describes a set of comparative experiments for the problem of
automatically filtering unwanted electronic mail messages. Several variants of
the AdaBoost algorithm with confidence-rated predictions [Schapire & Singer,
99] have been applied, which differ in the complexity of the base learners
considered. Tw... |
cs/0109020 | Modelling Semantic Association and Conceptual Inheritance for Semantic
Analysis | cs.CL | Allowing users to interact through language borders is an interesting
challenge for information technology. For the purpose of a computer assisted
language learning system, we have chosen icons for representing meaning on the
input interface, since icons do not depend on a particular language. However, a
key limitati... |
cs/0109022 | Interactive Timetabling | cs.PL cs.AI | Timetabling is a typical application of constraint programming whose task is
to allocate activities to slots in available resources respecting various
constraints like precedence and capacity. In this paper we present a basic
concept, a constraint model, and the solving algorithms for interactive
timetabling. Interac... |
cs/0109023 | Integrating Multiple Knowledge Sources for Robust Semantic Parsing | cs.CL cs.AI | This work explores a new robust approach for Semantic Parsing of unrestricted
texts. Our approach considers Semantic Parsing as a Consistent Labelling
Problem (CLP), allowing the integration of several knowledge types (syntactic
and semantic) obtained from different sources (linguistic and statistic). The
current imp... |
cs/0109025 | Dynamic Global Constraints: A First View | cs.PL cs.AI | Global constraints proved themselves to be an efficient tool for modelling
and solving large-scale real-life combinatorial problems. They encapsulate a
set of binary constraints and using global reasoning about this set they filter
the domains of involved variables better than arc consistency among the set of
binary ... |
cs/0109029 | Learning class-to-class selectional preferences | cs.CL | Selectional preference learning methods have usually focused on word-to-class
relations, e.g., a verb selects as its subject a given nominal class. This
papers extends previous statistical models to class-to-class preferences, and
presents a model that learns selectional preferences for classes of verbs. The
motivati... |
cs/0109030 | Knowledge Sources for Word Sense Disambiguation | cs.CL | Two kinds of systems have been defined during the long history of WSD:
principled systems that define which knowledge types are useful for WSD, and
robust systems that use the information sources at hand, such as, dictionaries,
light-weight ontologies or hand-tagged corpora. This paper tries to systematize
the relati... |
cs/0109031 | Enriching WordNet concepts with topic signatures | cs.CL | This paper explores the possibility of enriching the content of existing
ontologies. The overall goal is to overcome the lack of topical links among
concepts in WordNet. Each concept is to be associated to a topic signature,
i.e., a set of related words with associated weights. The signatures can be
automatically con... |
cs/0109034 | Relevant Knowledge First - Reinforcement Learning and Forgetting in
Knowledge Based Configuration | cs.AI cs.LG | In order to solve complex configuration tasks in technical domains, various
knowledge based methods have been developed. However their applicability is
often unsuccessful due to their low efficiency. One of the reasons for this is
that (parts of the) problems have to be solved again and again, instead of
being "learn... |
cs/0109039 | Testing for Mathematical Lineation in Jim Crace's "Quarantine" and T. S.
Eliot's "Four Quartets" | cs.CL | The mathematical distinction between prose and verse may be detected in
writings that are not apparently lineated, for example in T. S. Eliot's "Burnt
Norton", and Jim Crace's "Quarantine". In this paper we offer comments on
appropriate statistical methods for such work, and also on the nature of formal
innovation in... |
cs/0109040 | The Building of BODHI, a Bio-diversity Database System | cs.DB q-bio.PE | We have recently built a database system called BODHI, intended to store
plant bio-diversity information. It is based on an object-oriented modeling
approach and is developed completely around public-domain software. The unique
feature of BODHI is that it seamlessly integrates diverse types of data,
including taxonom... |
cs/0109042 | Intelligent Search of Correlated Alarms from Database containing Noise
Data | cs.NI cs.AI | Alarm correlation plays an important role in improving the service and
reliability in modern telecommunications networks. Most previous research of
alarm correlation didn't consider the effect of noise data in Database. This
paper focuses on the method of discovering alarm correlation rules from
database containing n... |
cs/0109084 | The Internet and Community Networks: Case Studies of Five U.S. Cities | cs.DB | This paper looks at five U.S. cities (Austin, Cleveland, Nashville, Portland,
and Washington, DC) and explores strategies being employed by community
activists and local governments to create and sustain community networking
projects. In some cities, community networking initiatives are relatively
mature, while in ot... |
cs/0109116 | Digital Color Imaging | cs.CV cs.GR | This paper surveys current technology and research in the area of digital
color imaging. In order to establish the background and lay down terminology,
fundamental concepts of color perception and measurement are first presented
us-ing vector-space notation and terminology. Present-day color recording and
reproductio... |
cs/0110003 | The temporal calculus of conditional objects and conditional events | cs.AI cs.LO | We consider the problem of defining conditional objects (a|b), which would
allow one to regard the conditional probability Pr(a|b) as a probability of a
well-defined event rather than as a shorthand for Pr(ab)/Pr(b). The next issue
is to define boolean combinations of conditional objects, and possibly also the
operat... |
cs/0110004 | Embedding conditional event algebras into temporal calculus of
conditionals | cs.AI cs.LO | In this paper we prove that all the existing conditional event algebras embed
into a three-valued extension of temporal logic of discrete past time, which
the authors of this paper have proposed in anothe paper as a general model of
conditional events.
First of all, we discuss the descriptive incompleteness of the ... |
cs/0110014 | The Open Language Archives Community and Asian Language Resources | cs.CL cs.DL | The Open Language Archives Community (OLAC) is a new project to build a
worldwide system of federated language archives based on the Open Archives
Initiative and the Dublin Core Metadata Initiative. This paper aims to
disseminate the OLAC vision to the language resources community in Asia, and to
show language techno... |
cs/0110015 | Richer Syntactic Dependencies for Structured Language Modeling | cs.CL | The paper investigates the use of richer syntactic dependencies in the
structured language model (SLM). We present two simple methods of enriching the
dependencies in the syntactic parse trees used for intializing the SLM. We
evaluate the impact of both methods on the perplexity (PPL) and
word-error-rate(WER, N-best ... |
cs/0110020 | Structuring Business Metadata in Data Warehouse Systems for Effective
Business Support | cs.DB | Large organizations today are being served by different types of data
processing and informations systems, ranging from the operational (OLTP)
systems, data warehouse systems, to data mining and business intelligence
applications. It is important to create an integrated repository of what these
systems contain and do... |
cs/0110021 | Alife Model of Evolutionary Emergence of Purposeful Adaptive Behavior | cs.NE | The process of evolutionary emergence of purposeful adaptive behavior is
investigated by means of computer simulations. The model proposed implies that
there is an evolving population of simple agents, which have two natural needs:
energy and reproduction. Any need is characterized quantitatively by a
corresponding m... |
cs/0110023 | Set Unification | cs.LO cs.AI cs.SC | The unification problem in algebras capable of describing sets has been
tackled, directly or indirectly, by many researchers and it finds important
applications in various research areas--e.g., deductive databases, theorem
proving, static analysis, rapid software prototyping. The various solutions
proposed are spread... |
cs/0110026 | Information retrieval in Current Research Information Systems | cs.IR cs.DL | In this paper we describe the requirements for research information systems
and problems which arise in the development of such system. Here is shown which
problems could be solved by using of knowledge markup technologies. Ontology
for Research Information System offered. Architecture for collecting research
data an... |
cs/0110027 | Part-of-Speech Tagging with Two Sequential Transducers | cs.CL | We present a method of constructing and using a cascade consisting of a left-
and a right-sequential finite-state transducer (FST), T1 and T2, for
part-of-speech (POS) disambiguation. Compared to an HMM, this FST cascade has
the advantage of significantly higher processing speed, but at the cost of
slightly lower acc... |
cs/0110032 | A logic-based approach to data integration | cs.DB cs.AI | An important aspect of data integration involves answering queries using
various resources rather than by accessing database relations. The process of
transforming a query from the database relations to the resources is often
referred to as query folding or answering queries using views, where the views
are the resou... |
cs/0110036 | Efficient algorithms for decision tree cross-validation | cs.LG | Cross-validation is a useful and generally applicable technique often
employed in machine learning, including decision tree induction. An important
disadvantage of straightforward implementation of the technique is its
computational overhead. In this paper we show that, for decision trees, the
computational overhead ... |
cs/0110041 | Towards Solving the Interdisciplinary Language Barrier Problem | cs.CY cs.CL cs.IR | This work aims to make it easier for a specialist in one field to find and
explore ideas from another field which may be useful in solving a new problem
arising in his practice. It presents a methodology which serves to represent
the relationships that exist between concepts, problems, and solution patterns
from diff... |
cs/0110044 | EquiX--A Search and Query Language for XML | cs.DB | EquiX is a search language for XML that combines the power of querying with
the simplicity of searching. Requirements for such languages are discussed and
it is shown that EquiX meets the necessary criteria. Both a graph-based
abstract syntax and a formal concrete syntax are presented for EquiX queries.
In addition, ... |
cs/0110047 | The Expresso Microarray Experiment Management System: The Functional
Genomics of Stress Responses in Loblolly Pine | cs.OH cs.CE q-bio.GN | Conception, design, and implementation of cDNA microarray experiments present
a variety of bioinformatics challenges for biologists and computational
scientists. The multiple stages of data acquisition and analysis have motivated
the design of Expresso, a system for microarray experiment management. Salient
aspects o... |
cs/0110048 | Multivariant Branching Prediction, Reflection, and Retrospection | cs.CE cs.DC | In branching simulation, a novel approach to simulation presented in this
paper, a multiplicity of plausible scenarios are concurrently developed and
implemented. In conventional simulations of complex systems, there arise from
time to time uncertainties as to which of two or more alternatives are more
likely to be p... |
cs/0110050 | What is the minimal set of fragments that achieves maximal parse
accuracy? | cs.CL | We aim at finding the minimal set of fragments which achieves maximal parse
accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street
Journal treebank show that counts of almost arbitrary fragments within parse
trees are important, leading to improved parse accuracy over previous models
tested on this ... |
cs/0110051 | Combining semantic and syntactic structure for language modeling | cs.CL | Structured language models for speech recognition have been shown to remedy
the weaknesses of n-gram models. All current structured language models are,
however, limited in that they do not take into account dependencies between
non-headwords. We show that non-headword dependencies contribute to
significantly improve... |
cs/0110052 | Mragyati : A System for Keyword-based Searching in Databases | cs.DB | The web, through many search engine sites, has popularized the keyword-based
search paradigm, where a user can specify a string of keywords and expect to
retrieve relevant documents, possibly ranked by their relevance to the query.
Since a lot of information is stored in databases (and not as HTML documents),
it is i... |
cs/0110053 | Machine Learning in Automated Text Categorization | cs.IR cs.LG | The automated categorization (or classification) of texts into predefined
categories has witnessed a booming interest in the last ten years, due to the
increased availability of documents in digital form and the ensuing need to
organize them. In the research community the dominant approach to this problem
is based on... |
cs/0110055 | Analytical solution of transient scalar wave and diffusion problems of
arbitrary dimensionality and geometry by RBF wavelet series | cs.NA cs.CE | This study applies the RBF wavelet series to the evaluation of analytical
solutions of linear time-dependent wave and diffusion problems of any
dimensionality and geometry. To the best of the author's knowledge, such
analytical solutions have never been achieved before. The RBF wavelets can be
understood an alternati... |
cs/0110057 | Generating Multilingual Personalized Descriptions of Museum Exhibits -
The M-PIRO Project | cs.CL cs.AI | This paper provides an overall presentation of the M-PIRO project. M-PIRO is
developing technology that will allow museums to generate automatically textual
or spoken descriptions of exhibits for collections available over the Web or in
virtual reality environments. The descriptions are generated in several
languages... |
cs/0110067 | Analysis of Investment Policy in Belarus | cs.CE | The optimal planning trajectory is analyzed on the basis of the growth model
with effectiveness. The saving per capital value has to be rather high
initially with smooth decrement in the future years.
|
cs/0111003 | The Use of Classifiers in Sequential Inference | cs.LG cs.CL | We study the problem of combining the outcomes of several different
classifiers in a way that provides a coherent inference that satisfies some
constraints. In particular, we develop two general approaches for an important
subproblem-identifying phrase structure. The first is a Markovian approach that
extends standar... |
cs/0111004 | The Relational Database Aspects of Argonne's ATLAS Control System | cs.DB | The Relational Database Aspects of Argonnes ATLAS Control System Argonnes
ATLAS (Argonne Tandem Linac Accelerator System) control system comprises two
separate database concepts. The first is the distributed real-time database
structure provided by the commercial product Vsystem [1]. The second is a more
static relat... |
cs/0111006 | Proliferation of SDDS Support for Various Platforms and Languages | cs.DB | Since Self-Describing Data Sets (SDDS) were first introduced, the source code
has been ported to many different operating systems and various languages. SDDS
is now available in C, Tcl, Java, Fortran, and Python. All of these versions
are supported on Solaris, Linux, and Windows. The C version of SDDS is also
support... |
cs/0111007 | Explaining Scenarios for Information Personalization | cs.HC cs.IR | Personalization customizes information access. The PIPE ("Personalization is
Partial Evaluation") modeling methodology represents interaction with an
information space as a program. The program is then specialized to a user's
known interests or information seeking activity by the technique of partial
evaluation. In t... |
cs/0111012 | Intelligent Anticipated Exploration of Web Sites | cs.AI cs.IR | In this paper we describe a web search agent, called Global Search Agent
(hereafter GSA for short). GSA integrates and enhances several search
techniques in order to achieve significant improvements in the user-perceived
quality of delivered information as compared to usual web search engines. GSA
features intelligen... |
cs/0111015 | The SDSS SkyServer, Public Access to the Sloan Digital Sky Server Data | cs.DL cs.DB | The SkyServer provides Internet access to the public Sloan Digital Sky Survey
(SDSS) data for both astronomers and for science education. This paper
describes the SkyServer goals and architecture. It also describes our
experience operating the SkyServer on the Internet. The SDSS data is public and
well-documented so ... |
cs/0111018 | Data Acquisition and Database Management System for Samsung
Superconductor Test Facility | cs.DB cs.AI | In order to fulfill the test requirement of KSTAR (Korea Superconducting
Tokamak Advanced Research) superconducting magnet system, a large scale
superconducting magnet and conductor test facility, SSTF (Samsung
Superconductor Test Facility), has been constructed at Samsung Advanced
Institute of Technology. The comput... |
cs/0111038 | Arc consistency for soft constraints | cs.AI cs.CC cs.DS | The notion of arc consistency plays a central role in constraint
satisfaction. It is known that the notion of local consistency can be extended
to constraint optimisation problems defined by soft constraint frameworks based
on an idempotent cost combination operator. This excludes non idempotent
operators such as + w... |
cs/0111051 | Predicting RNA Secondary Structures with Arbitrary Pseudoknots by
Maximizing the Number of Stacking Pairs | cs.CE cs.DS q-bio | The paper investigates the computational problem of predicting RNA secondary
structures. The general belief is that allowing pseudoknots makes the problem
hard. Existing polynomial-time algorithms are heuristic algorithms with no
performance guarantee and can only handle limited types of pseudoknots. In this
paper we... |
cs/0111054 | The similarity metric | cs.CC cond-mat.stat-mech cs.CE cs.CV math.CO math.MG math.ST physics.data-an q-bio.GN stat.TH | A new class of distances appropriate for measuring similarity relations
between sequences, say one type of similarity per distance, is studied. We
propose a new ``normalized information distance'', based on the noncomputable
notion of Kolmogorov complexity, and show that it is in this class and it
minorizes every com... |
cs/0111058 | Bayesian Logic Programs | cs.AI cs.LO | Bayesian networks provide an elegant formalism for representing and reasoning
about uncertainty using probability theory. Theyare a probabilistic extension
of propositional logic and, hence, inherit some of the limitations of
propositional logic, such as the difficulties to represent objects and
relations. We introdu... |
cs/0111060 | Gradient-based Reinforcement Planning in Policy-Search Methods | cs.AI | We introduce a learning method called ``gradient-based reinforcement
planning'' (GREP). Unlike traditional DP methods that improve their policy
backwards in time, GREP is a gradient-based method that plans ahead and
improves its policy before it actually acts in the environment. We derive
formulas for the exact polic... |
cs/0111063 | New RBF collocation methods and kernel RBF with applications | cs.NA cs.CE | A few novel radial basis function (RBF) discretization schemes for partial
differential equations are developed in this study. For boundary-type methods,
we derive the indirect and direct symmetric boundary knot methods. Based on the
multiple reciprocity principle, the boundary particle method is introduced for
gener... |
cs/0111064 | A procedure for unsupervised lexicon learning | cs.CL | We describe an incremental unsupervised procedure to learn words from
transcribed continuous speech. The algorithm is based on a conservative and
traditional statistical model, and results of empirical tests show that it is
competitive with other algorithms that have been proposed recently for this
task.
|
cs/0111065 | A Statistical Model for Word Discovery in Transcribed Speech | cs.CL | A statistical model for segmentation and word discovery in continuous speech
is presented. An incremental unsupervised learning algorithm to infer word
boundaries based on this model is described. Results of empirical tests showing
that the algorithm is competitive with other models that have been used for
similar ta... |
cs/0112003 | Using a Support-Vector Machine for Japanese-to-English Translation of
Tense, Aspect, and Modality | cs.CL | This paper describes experiments carried out using a variety of
machine-learning methods, including the k-nearest neighborhood method that was
used in a previous study, for the translation of tense, aspect, and modality.
It was found that the support-vector machine method was the most precise of all
the methods teste... |
cs/0112004 | Part of Speech Tagging in Thai Language Using Support Vector Machine | cs.CL | The elastic-input neuro tagger and hybrid tagger, combined with a neural
network and Brill's error-driven learning, have already been proposed for the
purpose of constructing a practical tagger using as little training data as
possible. When a small Thai corpus is used for training, these taggers have
tagging accurac... |
cs/0112005 | Universal Model for Paraphrasing -- Using Transformation Based on a
Defined Criteria -- | cs.CL | This paper describes a universal model for paraphrasing that transforms
according to defined criteria. We showed that by using different criteria we
could construct different kinds of paraphrasing systems including one for
answering questions, one for compressing sentences, one for polishing up, and
one for transform... |
cs/0112006 | A Logic Programming Approach to Knowledge-State Planning: Semantics and
Complexity | cs.AI cs.LO | We propose a new declarative planning language, called K, which is based on
principles and methods of logic programming. In this language, transitions
between states of knowledge can be described, rather than transitions between
completely described states of the world, which makes the language well-suited
for planni... |
cs/0112007 | A Tight Upper Bound on the Number of Candidate Patterns | cs.DB cs.AI | In the context of mining for frequent patterns using the standard levelwise
algorithm, the following question arises: given the current level and the
current set of frequent patterns, what is the maximal number of candidate
patterns that can be generated on the next level? We answer this question by
providing a tight... |
cs/0112008 | Representation of Uncertainty for Limit Processes | cs.AI cs.NA | Many mathematical models utilize limit processes. Continuous functions and
the calculus, differential equations and topology, all are based on limits and
continuity. However, when we perform measurements and computations, we can
achieve only approximate results. In some cases, this discrepancy between
theoretical sch... |
cs/0112009 | DNA Self-Assembly For Constructing 3D Boxes | cs.CC cs.CE | We propose a mathematical model of DNA self-assembly using 2D tiles to form
3D nanostructures. This is the first work to combine studies in self-assembly
and nanotechnology in 3D, just as Rothemund and Winfree did in the 2D case. Our
model is a more precise superset of their Tile Assembly Model that facilitates
build... |
cs/0112010 | A Straightforward Approach to Morphological Analysis and Synthesis | cs.CL cs.DS | In this paper we present a lexicon-based approach to the problem of
morphological processing. Full-form words, lemmas and grammatical tags are
interconnected in a DAWG. Thus, the process of analysis/synthesis is reduced to
a search in the graph, which is very fast and can be performed even if several
pieces of inform... |
cs/0112011 | Interactive Constrained Association Rule Mining | cs.DB cs.AI | We investigate ways to support interactive mining sessions, in the setting of
association rule mining. In such sessions, users specify conditions (queries)
on the associations to be generated. Our approach is a combination of the
integration of querying conditions inside the mining phase, and the incremental
querying... |
cs/0112013 | A Data Mining Framework for Optimal Product Selection in Retail
Supermarket Data: The Generalized PROFSET Model | cs.DB cs.AI | In recent years, data mining researchers have developed efficient association
rule algorithms for retail market basket analysis. Still, retailers often
complain about how to adopt association rules to optimize concrete retail
marketing-mix decisions. It is in this context that, in a previous paper, the
authors have i... |
cs/0112015 | Rational Competitive Analysis | cs.AI | Much work in computer science has adopted competitive analysis as a tool for
decision making under uncertainty. In this work we extend competitive analysis
to the context of multi-agent systems. Unlike classical competitive analysis
where the behavior of an agent's environment is taken to be arbitrary, we
consider th... |
cs/0112018 | Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix
Multiplication | cs.CL cs.DS | In 1975, Valiant showed that Boolean matrix multiplication can be used for
parsing context-free grammars (CFGs), yielding the asympotically fastest
(although not practical) CFG parsing algorithm known. We prove a dual result:
any CFG parser with time complexity $O(g n^{3 - \epsilson})$, where $g$ is the
size of the g... |
cs/0112019 | Distribution of Mutual Information | cs.AI cs.IT math.IT math.ST stat.TH | The mutual information of two random variables i and j with joint
probabilities t_ij is commonly used in learning Bayesian nets as well as in
many other fields. The chances t_ij are usually estimated by the empirical
sampling frequency n_ij/n leading to a point estimate I(n_ij/n) for the mutual
information. To answer... |
cs/0201002 | Incremental Construction of Compact Acyclic NFAs | cs.DS cs.CL | This paper presents and analyzes an incremental algorithm for the
construction of Acyclic Non-deterministic Finite-state Automata (NFA). Automata
of this type are quite useful in computational linguistics, especially for
storing lexicons. The proposed algorithm produces compact NFAs, i.e. NFAs that
do not contain equ... |
cs/0201005 | Sharpening Occam's Razor | cs.LG cond-mat.dis-nn cs.AI cs.CC math.PR physics.data-an | We provide a new representation-independent formulation of Occam's razor
theorem, based on Kolmogorov complexity. This new formulation allows us to:
(i) Obtain better sample complexity than both length-based and VC-based
versions of Occam's razor theorem, in many applications.
(ii) Achieve a sharper reverse of Oc... |
cs/0201008 | Using Tree Automata and Regular Expressions to Manipulate Hierarchically
Structured Data | cs.CL cs.DS | Information, stored or transmitted in digital form, is often structured.
Individual data records are usually represented as hierarchies of their
elements. Together, records form larger structures. Information processing
applications have to take account of this structuring, which assigns different
semantics to differ... |
cs/0201009 | The performance of the batch learner algorithm | cs.LG cs.DM | We analyze completely the convergence speed of the \emph{batch learning
algorithm}, and compare its speed to that of the memoryless learning algorithm
and of learning with memory. We show that the batch learning algorithm is never
worse than the memoryless learning algorithm (at least asymptotically). Its
performance... |
cs/0201013 | Computing Preferred Answer Sets by Meta-Interpretation in Answer Set
Programming | cs.LO cs.AI | Most recently, Answer Set Programming (ASP) is attracting interest as a new
paradigm for problem solving. An important aspect which needs to be supported
is the handling of preferences between rules, for which several approaches have
been presented. In this paper, we consider the problem of implementing
preference ha... |
cs/0201014 | The Dynamics of AdaBoost Weights Tells You What's Hard to Classify | cs.LG cs.DS | The dynamical evolution of weights in the Adaboost algorithm contains useful
information about the role that the associated data points play in the built of
the Adaboost model. In particular, the dynamics induces a bipartition of the
data set into two (easy/hard) classes. Easy points are ininfluential in the
making o... |
cs/0201016 | A computer scientist looks at game theory | cs.GT cs.DC cs.MA | I consider issues in distributed computation that should be of relevance to
game theory. In particular, I focus on (a) representing knowledge and
uncertainty, (b) dealing with failures, and (c) specification of mechanisms.
|
cs/0201017 | Collusion in Unrepeated, First-Price Auctions with an Uncertain Number
of Participants | cs.GT cs.AI | We consider the question of whether collusion among bidders (a "bidding
ring") can be supported in equilibrium of unrepeated first-price auctions.
Unlike previous work on the topic such as that by McAfee and McMillan [1992]
and Marshall and Marx [2007], we do not assume that non-colluding agents have
perfect knowledg... |
cs/0201019 | Structure from Motion: Theoretical Foundations of a Novel Approach Using
Custom Built Invariants | cs.CV math.DG | We rephrase the problem of 3D reconstruction from images in terms of
intersections of projections of orbits of custom built Lie groups actions. We
then use an algorithmic method based on moving frames "a la Fels-Olver" to
obtain a fundamental set of invariants of these groups actions. The invariants
are used to defin... |
cs/0201020 | A Modal Logic Framework for Multi-agent Belief Fusion | cs.AI cs.LO | This paper is aimed at providing a uniform framework for reasoning about
beliefs of multiple agents and their fusion. In the first part of the paper, we
develop logics for reasoning about cautiously merged beliefs of agents with
different degrees of reliability. The logics are obtained by combining the
multi-agent ep... |
cs/0201021 | Learning to Play Games in Extensive Form by Valuation | cs.LG cs.GT | A valuation for a player in a game in extensive form is an assignment of
numeric values to the players moves. The valuation reflects the desirability
moves. We assume a myopic player, who chooses a move with the highest
valuation. Valuations can also be revised, and hopefully improved, after each
play of the game. He... |
cs/0201022 | A theory of experiment | cs.AI | This article aims at clarifying the language and practice of scientific
experiment, mainly by hooking observability on calculability.
|
cs/0201024 | Design of statistical quality control procedures using genetic
algorithms | cs.NE | In general, we can not use algebraic or enumerative methods to optimize a
quality control (QC) procedure so as to detect the critical random and
systematic analytical errors with stated probabilities, while the probability
for false rejection is minimum. Genetic algorithms (GAs) offer an alternative,
as they do not r... |
cs/0201026 | An Empirical Model for Volatility of Returns and Option Pricing | cs.CE | In a seminal paper in 1973, Black and Scholes argued how expected
distributions of stock prices can be used to price options. Their model assumed
a directed random motion for the returns and consequently a lognormal
distribution of asset prices after a finite time. We point out two problems
with their formulation. Fi... |
cs/0202001 | The Deductive Database System LDL++ | cs.DB cs.AI | This paper describes the LDL++ system and the research advances that have
enabled its design and development. We begin by discussing the new nonmonotonic
and nondeterministic constructs that extend the functionality of the LDL++
language, while preserving its model-theoretic and fixpoint semantics. Then, we
describe ... |
cs/0202004 | A Qualitative Dynamical Modelling Approach to Capital Accumulation in
Unregulated Fisheries | cs.AI cs.CE | Capital accumulation has been a major issue in fisheries economics over the
last two decades, whereby the interaction of the fish and capital stocks were
of particular interest. Because bio-economic systems are intrinsically complex,
previous efforts in this field have relied on a variety of simplifying
assumptions. ... |
cs/0202005 | Secure History Preservation Through Timeline Entanglement | cs.DC cs.CR cs.DB cs.DS | A secure timeline is a tamper-evident historic record of the states through
which a system goes throughout its operational history. Secure timelines can
help us reason about the temporal ordering of system states in a provable
manner. We extend secure timelines to encompass multiple, mutually distrustful
services, us... |
cs/0202007 | Steady State Resource Allocation Analysis of the Stochastic Diffusion
Search | cs.AI cs.NE | This article presents the long-term behaviour analysis of Stochastic
Diffusion Search (SDS), a distributed agent-based system for best-fit pattern
matching. SDS operates by allocating simple agents into different regions of
the search space. Agents independently pose hypotheses about the presence of
the pattern in th... |
cs/0202009 | Non-negative sparse coding | cs.NE cs.CV | Non-negative sparse coding is a method for decomposing multivariate data into
non-negative sparse components. In this paper we briefly describe the
motivation behind this type of data representation and its relation to standard
sparse coding and non-negative matrix factorization. We then give a simple yet
efficient m... |
cs/0202012 | Logic program specialisation through partial deduction: Control issues | cs.PL cs.AI | Program specialisation aims at improving the overall performance of programs
by performing source to source transformations. A common approach within
functional and logic programming, known respectively as partial evaluation and
partial deduction, is to exploit partial knowledge about the input. It is
achieved throug... |
cs/0202013 | The SDSS SkyServer: Public Access to the Sloan Digital Sky Server Data | cs.DL cs.DB | The SkyServer provides Internet access to the public Sloan Digi-tal Sky
Survey (SDSS) data for both astronomers and for science education. This paper
describes the SkyServer goals and archi-tecture. It also describes our
experience operating the SkyServer on the Internet. The SDSS data is public and
well-documented s... |
cs/0202014 | Data Mining the SDSS SkyServer Database | cs.DB cs.DL | An earlier paper (Szalay et. al. "Designing and Mining MultiTerabyte
Astronomy Archives: The Sloan Digital Sky Survey," ACM SIGMOD 2000) described
the Sloan Digital Sky Survey's (SDSS) data management needs by defining twenty
database queries and twelve data visualization tasks that a good data
management system shou... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.