Sciweavers

8331 search results - page 198 / 1667
» Data Aggregation Sets in Adaptive Data Model
Sort
View
NIPS
1998
15 years 7 months ago
Learning from Dyadic Data
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
Thomas Hofmann, Jan Puzicha, Michael I. Jordan
LREC
2008
125views Education» more  LREC 2008»
15 years 8 months ago
Adaptation of Relation Extraction Rules to New Domains
This paper presents various strategies for improving the extraction performance of less prominent relations with the help of the rules learned for similar relations, for which lar...
Feiyu Xu, Hans Uszkoreit, Hong Li, Niko Felger
CIA
2008
Springer
15 years 8 months ago
Trust-Based Classifier Combination for Network Anomaly Detection
Abstract. We present a method that improves the results of network intrusion detection by integration of several anomaly detection algorithms through trust and reputation models. O...
Martin Rehák, Michal Pechoucek, Martin Gril...
ICDT
2009
ACM
121views Database» more  ICDT 2009»
16 years 7 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 6 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...