Sciweavers

ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
14 years 5 months ago
A Generalization of Proximity Functions for K-Means
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
Junjie Wu, Hui Xiong, Jian Chen, Wenjun Zhou
ICDM
2007
IEEE
126views Data Mining» more  ICDM 2007»
14 years 5 months ago
Exploration of Link Structure and Community-Based Node Roles in Network Analysis
Communities are nodes in a network that are grouped together based on a common set of properties. While the communities and link structures are often thought to be in alignment, i...
Jerry Scripps, Pang-Ning Tan, Abdol-Hossein Esfaha...
ICDM
2007
IEEE
147views Data Mining» more  ICDM 2007»
14 years 5 months ago
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights
Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collabo...
Robert M. Bell, Yehuda Koren
ICDM
2007
IEEE
103views Data Mining» more  ICDM 2007»
14 years 5 months ago
Mechanism Design for Clustering Aggregation by Selfish Systems
We propose a market mechanism that can be implemented on clustering aggregation problem among selfish systems, which tend to lie about their correct clustering during aggregation ...
Pinata Winoto, Yiu-ming Cheung, Jiming Liu
ICDM
2007
IEEE
198views Data Mining» more  ICDM 2007»
14 years 5 months ago
Social Network Extraction of Academic Researchers
This paper addresses the issue of extraction of an academic researcher social network. By researcher social network extraction, we are aimed at finding, extracting, and fusing the...
Jie Tang, Duo Zhang, Limin Yao
ICDM
2007
IEEE
101views Data Mining» more  ICDM 2007»
14 years 5 months ago
Lightweight Distributed Trust Propagation
Using mobile devices, such as smart phones, people may create and distribute different types of digital content (e.g., photos, videos). One of the problems is that digital content...
Daniele Quercia, Stephen Hailes, Licia Capra
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
14 years 5 months ago
Statistical Learning Algorithm for Tree Similarity
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
14 years 5 months ago
Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
ICDM
2007
IEEE
183views Data Mining» more  ICDM 2007»
14 years 5 months ago
Depth-Based Novelty Detection and Its Application to Taxonomic Research
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...
Yixin Chen, Henry L. Bart Jr., Xin Dang, Hanxiang ...
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
14 years 5 months ago
Bandit-Based Algorithms for Budgeted Learning
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is s...
Kun Deng, Chris Bourke, Stephen D. Scott, Julie Su...