Search
Now showing items 1-10 of 159
Induction of logical relations based on specific generalization of strings
(Bilkent University, 2007)
Learning logical relations from examples expressed as first order facts has been
studied extensively by the Inductive Logic Programming research. Learning with
positive-only data may cause overgeneralization of examples ...
Example based machine translation with type associated translation examples
(Bilkent University, 2007)
Example based machine translation is a translation technique that leans on
machine learning paradigm. This technique had been modeled by the learning
process as: a man is given short and simple sentences in language A ...
Chisio : a visual framework for compound graph editing and layout
(Bilkent University, 2007)
Graphs are data models, widely used in many areas from networking to biology to
computer science. Visualization, interactive editing ability and layout of graphs
are critical issues when analyzing the underlying relational ...
Regression by selecting best feature(s)
(Bilkent University, 2000)
Two new machine learning methods, Regression by Selecting Best Feature Projections (RSBFP) and Regression by Selecting Best Features (RSBF), are presented for regression problems. These methods heavily make use of least ...
A graph based approach for finding people in news
(Bilkent University, 2007)
Along with the recent advances in technology, large quantities of multi-modal
data has arisen and became prevalent. Hence, effective and efficient retrieval,
organization and analysis of such data constitutes a big ...
Turkish text to speech system
(Bilkent University, 2002)
Scientists have been interested in producing human speech artificially for more than two
centuries. After the invention of computers, computers have been used in order to
synthesize speech. By the help of ...
Benefit maximizing classification using feature intervals
(Bilkent University, 2002)
For a long time, classification algorithms have focused on minimizing the quantity of
prediction errors by assuming that each possible error has identical consequences.
However, in many real-world situations, this ...
Predicting next page access by time length reference in the scope of effective use of resources
(Bilkent University, 2002)
Access log file is like a box of treasure waiting to be exploited containing
valuable information for the web usage mining system. We can convert this
information hidden in the access log files into knowledge by analyzing ...
Adaptation of multiway-merge sorting algorithm to MIMD architectures with an experimental study
(Bilkent University, 2002)
Sorting is perhaps one of the most widely studied problems of computing. Numerous
asymptotically optimal sequential algorithms have been discovered. Asymptotically
optimal algorithms have been presented for varying ...
Data decomposition techniques for parallel tree-based k-means clustering
(Bilkent University, 2002)
The main computation in the k-means clustering is distance calculations between
cluster centroids and patterns. As the number of the patterns and the number of centroids
increases, time needed to complete computations ...