Sciweavers

507 search results - page 47 / 102
» Sizes of Ordered Decision Trees
Sort
View
TKDE
2011
363views more  TKDE 2011»
13 years 2 months ago
Efficient Techniques for Online Record Linkage
—The need to consolidate the information contained in heterogeneous data sources has been widely documented in recent years. In order to accomplish this goal, an organization mus...
Debabrata Dey, Vijay S. Mookerjee, Dengpan Liu
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
IEAAIE
2004
Springer
14 years 1 months ago
Data Mining Approach for Analyzing Call Center Performance
Abstract. The aim of our research was to apply well-known data mining techniques (such as linear neural networks, multi-layered perceptrons, probabilistic neural networks, classifi...
Marcin Paprzycki, Ajith Abraham, Ruiyuan Guo, Srin...
SGAI
2007
Springer
14 years 2 months ago
Towards a Computationally Efficient Approach to Modular Classification Rule Induction
Induction of classification rules is one of the most important technologies in data mining. Most of the work in this field has concentrated on the Top Down Induction of Decision T...
Frederic T. Stahl, Max Bramer
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 9 months ago
Greedy List Intersection
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...