Sciweavers

732 search results - page 127 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 8 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
ROCAI
2004
Springer
14 years 1 months ago
Learning Mixtures of Localized Rules by Maximizing the Area Under the ROC Curve
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
Tobias Sing, Niko Beerenwinkel, Thomas Lengauer
WWW
2008
ACM
14 years 8 months ago
Information retrieval and knowledge discovery on the semantic web of traditional chinese medicine
We conduct the first systematical adoption of the Semantic Web solution in the integration, management, and utilization of TCM information and knowledge resources. As the results,...
Zhaohui Wu, Tong Yu, Huajun Chen, Xiaohong Jiang, ...
BMCBI
2002
120views more  BMCBI 2002»
13 years 7 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam
PETRA
2009
ACM
14 years 2 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...