Sciweavers

1998 search results - page 149 / 400
» Basic Association Rules
Sort
View
TEC
2008
104views more  TEC 2008»
15 years 2 months ago
Genetic-Fuzzy Data Mining With Divide-and-Conquer Strategy
Data mining is most commonly used in attempts to induce association rules from transaction data. Most previous studies focused on binary-valued transaction data. Transaction data i...
Tzung-Pei Hong, Chun-Hao Chen, Yeong-Chyi Lee, Yu-...
139
Voted
ICLP
2010
Springer
15 years 6 months ago
Abductive Inference in Probabilistic Logic Programs
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
Gerardo I. Simari, V. S. Subrahmanian
ICC
2007
IEEE
111views Communications» more  ICC 2007»
15 years 9 months ago
TDM Emulation in Packet-Switched Networks
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). In this work, we study the problem of desig...
George N. Rouskas, Nikhil Baradwaj
110
Voted
ICCV
2005
IEEE
15 years 8 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
145
Voted
CADE
2002
Springer
16 years 2 months ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
Robert R. Schneck, George C. Necula