32 search results - page 3 / 7 » On data mining, compression, and Kolmogorov complexity |
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
68
Voted
WEBI
2009
Springer
15 years 4 months ago
2009
Springer
—On participatory Websites, users provide opinions about products, with both overall ratings and textual reviews. In this paper, we propose an approach to accurately estimate fea...
88
Voted
JCST
2010
14 years 8 months ago
2010
Fast changing knowledge on the Internet can be acquired more efficiently with the help of automatic document summarization and updating techniques. This paper describes a novel app...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
70
Voted
LATA
2010
Springer
15 years 4 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...