Sciweavers

2064 search results - page 166 / 413
» A Comparative Study of Fuzzy Sets and Rough Sets
Sort
View
IRI
2007
IEEE
16 years 22 days ago
Acronym-Expansion Recognition and Ranking on the Web
The paper presents a study on large-scale automatic extraction of acronyms and associated expansions from Web data and from the user interactions with this data through Web search...
Alpa Jain, Silviu Cucerzan, Saliha Azzam
PAKDD
2005
ACM
161views Data Mining» more  PAKDD 2005»
15 years 12 months ago
Online Algorithms for Mining Inter-stream Associations from Large Sensor Networks
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
K. K. Loo, Ivy Tong, Ben Kao
ERCIMDL
2001
Springer
128views Education» more  ERCIMDL 2001»
15 years 11 months ago
Evaluating Electronic Textbooks: A Methodology
EBONI (Electronic Books ON-screen Interface) [1] builds on the premise to emerge from the Visual Book [2] and WEB Book projects [3], that appearance is important in the design of e...
Ruth Wilson, Monica Landoni
ML
1998
ACM
148views Machine Learning» more  ML 1998»
15 years 6 months ago
Colearning in Differential Games
Game playing has been a popular problem area for research in artificial intelligence and machine learning for many years. In almost every study of game playing and machine learnin...
John W. Sheppard
JMLR
2010
121views more  JMLR 2010»
15 years 1 months ago
Efficient Collapsed Gibbs Sampling for Latent Dirichlet Allocation
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...
Han Xiao, Thomas Stibor