Sciweavers

20294 search results - page 11 / 4059
» Algorithmic Information Theory
Sort
View
MST
2007
168views more  MST 2007»
14 years 11 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
RSKT
2009
Springer
15 years 4 months ago
A Time-Reduction Strategy to Feature Selection in Rough Set Theory
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...
Hongxing Chen, Yuhua Qian, Jiye Liang, Wei Wei, Fe...
SIGIR
2002
ACM
14 years 11 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby
IJIS
2008
83views more  IJIS 2008»
14 years 11 months ago
An algorithm for modelling key terms
The ability to analyse and represent formally semantic relations of terms is a core issue in information retrieval (IR), natural language processing (NLP), and in many related are...
D. Cai, C. J. van Rijsbergen
GRC
2010
IEEE
15 years 23 days ago
Local Pattern Mining from Sequences Using Rough Set Theory
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
Ken Kaneiwa, Yasuo Kudo