Sciweavers

176 search results - page 12 / 36
» Discovering and ranking important rules
Sort
View
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
14 years 2 months ago
An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
Shiby Thomas, Sreenath Bodagala, Khaled Alsabti, S...
ENC
2004
IEEE
14 years 1 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
APWEB
2008
Springer
13 years 12 months ago
Mining, Ranking, and Using Acronym Patterns
Techniques for being able to automatically identify acronym patterns are very important for enhancing a multitude of applications that rely upon search. This task is challenging, d...
Xiaonan Ji, Gu Xu, James Bailey, Hang Li
ISTA
2007
13 years 11 months ago
Resolving Indifferences in Multiple Attribute Business Information System Selection with Social Choice Methods
: The evaluation of Information Systems (IS) is a critical process for the successful development of any organizational IT capability. An important class of decision making techniq...
Edward Bernroider, Johann Mitlöhner
CORR
2008
Springer
216views Education» more  CORR 2008»
13 years 10 months ago
Building an interpretable fuzzy rule base from data using Orthogonal Least Squares Application to a depollution problem
In many fields where human understanding plays a crucial role, such as bioprocesses, the capacity of extracting knowledge from data is of critical importance. Within this framewor...
Sébastien Destercke, Serge Guillaume, Brigi...