Sciweavers

917 search results - page 142 / 184
» Mining interesting sets and rules in relational databases
Sort
View
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
15 years 10 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
15 years 10 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 4 months ago
Clustering with Multiple Graphs
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
Wei Tang, Zhengdong Lu, Inderjit S. Dhillon
TDP
2010
140views more  TDP 2010»
14 years 4 months ago
Movement Data Anonymity through Generalization
In recent years, spatio-temporal and moving objects databases have gained considerable interest, due to the diffusion of mobile devices (e.g., mobile phones, RFID devices and GPS ...
Anna Monreale, Gennady L. Andrienko, Natalia V. An...
KDD
2005
ACM
106views Data Mining» more  KDD 2005»
15 years 3 months ago
Enhancing the lift under budget constraints: an application in the mutual fund industry
A lift curve, with the true positive rate on the y-axis and the customer pull (or contact) rate on the x-axis, is often used to depict the model performance in many data mining ap...
Lian Yan, Michael Fassino, Patrick Baldasare