Sciweavers

1314 search results - page 212 / 263
» Approximate data mining in very large relational data
Sort
View
INFORMS
2010
177views more  INFORMS 2010»
15 years 2 months ago
Binarized Support Vector Machines
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...
VLDB
2001
ACM
157views Database» more  VLDB 2001»
16 years 4 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
VLDB
2005
ACM
144views Database» more  VLDB 2005»
15 years 9 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
INFOCOM
1994
IEEE
15 years 8 months ago
Scheduling Nonuniform Traffic in a Packet Switching System with Small Propagation Delay
A new model of nonuniform traffic is introduced for a single-hop packet-switching system. This traffic model allows arbitrary traffic streams subject only to a constraint on the nu...
Timothy Weller, Bruce Hajek
VLDB
2007
ACM
141views Database» more  VLDB 2007»
16 years 4 months ago
Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianc...