Sciweavers

481 search results - page 67 / 97
» Learning relational probability trees
Sort
View
WWW
2002
ACM
16 years 13 days ago
A machine learning based approach for table detection on the web
Table is a commonly used presentation scheme, especially for describing relational information. However, table understanding remains an open problem. In this paper, we consider th...
Yalin Wang, Jianying Hu
101
Voted
IADIS
2004
15 years 1 months ago
Constructing Scorm Compliant Course Based on High Level Petri Nets
With rapid development of the Internet, e-learning system has become more and more popular. Currently, to solve the issue of sharing and reusing of teaching materials in different...
Jun-Ming Su, Shian-Shyong Tseng, Chia-Yu Chen, Jui...
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 5 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
IDA
2010
Springer
15 years 1 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
AI
2008
Springer
14 years 12 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson