Sciweavers

1976 search results - page 243 / 396
» Predictive Graph Mining
Sort
View
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
14 years 2 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf
KDD
1995
ACM
106views Data Mining» more  KDD 1995»
14 years 1 months ago
Structured and Unstructured Induction with EDAGs
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
Brian R. Gaines
DATESO
2010
148views Database» more  DATESO 2010»
13 years 8 months ago
Using Spectral Clustering for Finding Students' Patterns of Behavior in Social Networks
Abstract. The high dimensionality of the data generated by social networks has been a big challenge for researchers. In order to solve the problems associated with this phenomenon,...
Gamila Obadi, Pavla Drázdilová, Jan ...
ICPR
2008
IEEE
14 years 4 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...
ACL
2008
13 years 11 months ago
Robust Dialog Management with N-Best Hypotheses Using Dialog Examples and Agenda
This work presents an agenda-based approach to improve the robustness of the dialog manager by using dialog examples and n-best recognition hypotheses. This approach supports n-be...
Cheongjae Lee, Sangkeun Jung, Gary Geunbae Lee