Sciweavers

1453 search results - page 121 / 291
» Mining for Useful Association Rules Using the ATMS
Sort
View
CP
2011
Springer
14 years 3 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
BMCBI
2006
116views more  BMCBI 2006»
15 years 4 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
ICDM
2003
IEEE
153views Data Mining» more  ICDM 2003»
15 years 9 months ago
Dimensionality Reduction Using Kernel Pooled Local Discriminant Information
We study the use of kernel subspace methods for learning low-dimensional representations for classification. We propose a kernel pooled local discriminant subspace method and com...
Peng Zhang, Jing Peng, Carlotta Domeniconi
KDD
1995
ACM
104views Data Mining» more  KDD 1995»
15 years 7 months ago
Using Rough Sets as Tools for Knowledge Discovery
An attribute-oriented rough set method for knowledgediscovery in databases is described. Themethodis based on information generalization, whichexaminesthe data at various levels o...
Ning Shan, Wojciech Ziarko, Howard J. Hamilton, Ni...
MSR
2005
ACM
15 years 9 months ago
Recovering system specific rules from software repositories
One of the most successful applications of static analysis based bug finding tools is to search the source code for violations of system-specific rules. These rules may describe h...
Chadd C. Williams, Jeffrey K. Hollingsworth