Sciweavers

295 search results - page 30 / 59
» Finding Interesting Rules from Large Sets of Discovered Asso...
Sort
View
KR
2004
Springer
14 years 1 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
HIPC
1999
Springer
14 years 5 days ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
JASIS
2000
143views more  JASIS 2000»
13 years 7 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
CIB
2002
100views more  CIB 2002»
13 years 7 months ago
Web-log Mining for Quantitative Temporal-Event Prediction
The web log data embed much of web users' browsing behavior. From the web logs, one can discover patterns that predict the users' future requests based on their current b...
Qiang Yang, Hui Wang, Wei Zhang