Sciweavers

145 search results - page 12 / 29
» Mining closed relational graphs with connectivity constraint...
Sort
View
IDA
2002
Springer
14 years 11 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
13 years 2 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
IAJIT
2008
223views more  IAJIT 2008»
14 years 11 months ago
A New Exam Scheduling Algorithm Using Graph Coloring
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
Mohammad Malkawi, Mohammad Al-Haj Hassan, Osama Al...
JGAA
2007
124views more  JGAA 2007»
14 years 11 months ago
Energy Models for Graph Clustering
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
Andreas Noack
99
Voted
ITA
2006
163views Communications» more  ITA 2006»
14 years 11 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...