Sciweavers

2227 search results - page 124 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
104
Voted
DAC
2001
ACM
16 years 1 months ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
DMIN
2009
142views Data Mining» more  DMIN 2009»
14 years 10 months ago
Action Selection in Customer Value Optimization: An Approach Based on Covariate-Dependent Markov Decision Processes
Typical methods in CRM marketing include action selection on the basis of Markov Decision Processes with fixed transition probabilities on the one hand, and scoring customers separ...
Angi Roesch, Harald Schmidbauer
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 1 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
98
Voted
ECML
2007
Springer
15 years 7 months ago
Discovering Word Meanings Based on Frequent Termsets
Word meaning ambiguity has always been an important problem in information retrieval and extraction, as well as, text mining (documents clustering and classification). Knowledge di...
Henryk Rybinski, Marzena Kryszkiewicz, Grzegorz Pr...
PAKDD
2011
ACM
214views Data Mining» more  PAKDD 2011»
14 years 3 months ago
Spectral Analysis of k-Balanced Signed Graphs
Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...
Leting Wu, Xiaowei Ying, Xintao Wu, Aidong Lu, Zhi...