Sciweavers

2497 search results - page 119 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
15 years 2 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
14 years 11 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...
IJBIDM
2006
75views more  IJBIDM 2006»
14 years 10 months ago
Web process and workflow path mining using the Multimethod approach
: Workflow Management Systems (WfMS) provide a fundamental technological infrastructure to define and manage business processes efficiently. WfMS logs contain valuable data that ca...
Jorge Cardoso, Mitja Lenic
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
15 years 4 months ago
Fine-Grain Perturbation for Privacy Preserving Data Publishing
— Recent work [12] shows that conventional privacy preserving publishing techniques based on anonymity-groups are susceptible to corruption attacks. In a corruption attack, if th...
Rhonda Chaytor, Ke Wang, Patricia Brantingham