Sciweavers

1998 search results - page 399 / 400
» Basic Association Rules
Sort
View
CEAS
2011
Springer
13 years 11 months ago
Spam detection using web page content: a new battleground
Traditional content-based e-mail spam filtering takes into account content of e-mail messages and apply machine learning techniques to infer patterns that discriminate spams from...
Marco Túlio Ribeiro, Pedro Henrique Calais ...
CPP
2011
107views more  CPP 2011»
13 years 11 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
13 years 2 months ago
Transparent user models for personalization
Personalization is a ubiquitous phenomenon in our daily online experience. While such technology is critical for helping us combat the overload of information we face, in many cas...
Khalid El-Arini, Ulrich Paquet, Ralf Herbrich, Jur...
AGENTS
1997
Springer
15 years 3 months ago
RoboCup: The Robot World Cup Initiative
The Robot World Cup Initiative (RoboCup) is an attempt to foster AI and intelligent robotics research by providing a standard problem where wide range of technologies can be integ...
Hiroaki Kitano, Minoru Asada, Yasuo Kuniyoshi, Its...
IANDC
2008
141views more  IANDC 2008»
14 years 11 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...