Filters








39,596 Hits in 9.4 sec

Simultaneous Clustering and Ranking from Pairwise Comparisons

Jiyi Li, Yukino Baba, Hisashi Kashima
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
Our research question in this paper is whether the pairwise comparisons for clustering also help ranking (and vice versa).  ...  The grouping task is referred to as clustering and the prioritizing task is called as ranking. These tasks are often outsourced with the help of human judgments in the form of pairwise comparisons.  ...  We propose the new problem of simultaneous clustering and ranking from two types of pairwise comparisons: the pairwise similarity comparison and the pairwise preference comparison. 2.  ... 
doi:10.24963/ijcai.2018/215 dblp:conf/ijcai/LiBK18 fatcat:xuhyokq2u5efheoivu3rykivty

Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [article]

Guanxing Lu, Yuheng Jia, Junhui Hou
2022 arXiv   pre-print
In this letter, we propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix  ...  By representing the limited amount of supervisory information as a pairwise constraint matrix, we observe that the ideal affinity matrix for clustering shares the same low-rank structure as the ideal pairwise  ...  Comparison of Clustering Accuracy Fig. 2 compares the clustering accuracy and NMI of different methods under various numbers of pairwise constraints, from which we can draw the following conclusions.  ... 
arXiv:2205.10481v1 fatcat:t4fktw4orngoxcowxmezuysxdu

Matrix Completion for Cross-view Pairwise Constraint Propagation

Zheng Yang, Yao Hu, Haifeng Liu, Huajun Chen, Zhaohui Wu
2014 Proceedings of the ACM International Conference on Multimedia - MM '14  
With low rank requirement and graph regularization, our MCPCP can preserve local and global consistency simultaneously.  ...  In order to address this drawback, we cast cross-view pairwise constraint propagation into a problem of low rank matrix completion and propose a Matrix Completion method for cross-view Pairwise Constraint  ...  So our MCPCP can preserve local and global consistency simultaneously.  ... 
doi:10.1145/2647868.2655057 dblp:conf/mm/YangHLCW14 fatcat:dzz7rq76trd6ddsny7b7n5raha

EmbeddingVis: A Visual Analytics Approach to Comparative Network Embedding Inspection [article]

Quan Li, Kristanto Sean Njotoprawiro, Hammad Haleem, Qiaoan Chen, Chris Yi, Xiaojuan Ma
2018 arXiv   pre-print
To be more specific, it facilitates comparison of what and how node metrics are preserved across different embedding models and investigation of relationships between node metrics and selected embedding  ...  Constructing latent vector representation for nodes in a network through embedding models has shown its practicality in many graph analysis applications, such as node classification, clustering, and link  ...  ACKNOWLEDGMENTS We are grateful for the valuable feedback and comments provided by Prof. Huamin Qu and the anonymous reviewers.  ... 
arXiv:1808.09074v1 fatcat:4gnar2eovnb2xj6lleuxktrkye

EmbeddingVis: A Visual Analytics Approach to Comparative Network Embedding Inspection

Quan Li, Kristanto Sean Njotoprawiro, Hammad Haleem, Qiaoan Chen, Chris Yi, Xiaojuan Ma
2018 2018 IEEE Conference on Visual Analytics Science and Technology (VAST)  
If it is the author's pre-published version, changes introduced as a result of publishing processes such as copy-editing and formatting may not be reflected in this document.  ...  ACKNOWLEDGMENTS We are grateful for the valuable feedback and comments provided by Prof. Huamin Qu and the anonymous reviewers.  ...  This research was supported in part by WeChat-HKUST Joint Lab on AI Technology (WHAT LAB) grant#1617170-0 and HK RGC GRF 16213317.  ... 
doi:10.1109/vast.2018.8802454 dblp:conf/ieeevast/LiNHCYM18 fatcat:5solfjf62ra3dbc7dqcchqn53y

Comparative Study of Clustering Algorithms using Overall SimSUX Similarity Function for XML Documents

Damny Magdaleno
2015 Inteligencia Artificial  
One of the methods that many researchers have focused on is clustering, which groups similar XML data, according to their content and structures.  ...  Based on our analysis, we arrived to two important results: (1) The Fuzzy-SKWIC clustering algorithm works best both with methodology and without methodology, although there are not present significant  ...  SKWIC 0.00617 a b Table 5 . 5 Wilcoxon's test statistics of pairwise comparison, when the methodology is used (i.e. mG-Star) and when is not (i.e G-Star) Pairwise comparisons Sum of Ranks (p-value  ... 
doi:10.4114/ia.v18i55.1097 fatcat:4mtnb4flcfcdjdfhor2cazekoe

Constrained Clustering and Multiple Kernel Learning without Pairwise Constraint Relaxation [article]

Benedikt Boecking, Vincent Jeanselme, Artur Dubrawski
2022 arXiv   pre-print
We introduce a new constrained clustering algorithm that jointly clusters data and learns a kernel in accordance with the available pairwise constraints.  ...  These pairwise constraints, which come in the form of must-link and cannot-link pairs, arise naturally in many applications and are intuitive for users to provide.  ...  Acknowledgements This work was partially supported by a Space Technology Research Institutes grant from NASA's Space Technology Research Grants Program and by Defense Advanced Research Projects Agency's  ... 
arXiv:2203.12546v1 fatcat:h43kwo6a6reyjj6kly4w7z5zu4

Coherent image annotation by learning semantic distance

Tao Mei, Yong Wang, Xian-Sheng Hua, Shaogang Gong, Shipeng Li
2008 2008 IEEE Conference on Computer Vision and Pattern Recognition  
To annotate a new image, the training images in each cluster are ranked according to their SDF values with respect to this image and their corresponding annotations are then propagated to this image as  ...  Specifically, a semantic distance function (SDF) is learned for each semantic cluster to measure the semantic similarity based on relative comparison relations of prior annotations.  ...  The learning of SDF is based on the relative comparison relations rather than the absolute pairwise distances. 3) SDF-based image ranking.  ... 
doi:10.1109/cvpr.2008.4587386 dblp:conf/cvpr/MeiWHGL08 fatcat:spuhmhifh5d2lixitrswq4ehvq

Feature cluster: Learning perspectives in Multiple Criteria Decision Analysis

Salvatore Greco, Miłosz Kadziński
2018 European Journal of Operational Research  
Solving decision problems involves at least two simultaneous learning processes.  ...  The implementation of such a mutual learning process is particularly important in view of an increasing interest in MCDA in domains ranging from environmental management through industrial design and urban  ...  We express our gratitude to Roman S lowiński -the Co-ordinating Editor of European Journal of Operational Research -for his support and useful remarks.  ... 
doi:10.1016/j.ejor.2017.08.046 fatcat:4z2e527s6ngl5doszznvujm27e

One-Shot Neural Architecture Search via Novelty Driven Sampling

Miao Zhang, Huiqi Li, Shirui Pan, Taoping Liu, Steven Su
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Most state-of-the-art One-Shot NAS methods use the validation accuracy based on inheriting weights from the supernet as the stepping stone to search for the best performing architecture, adopting a bilevel  ...  However, recent works have found that there is no positive correlation between the above validation accuracy and test accuracy for these One-Shot NAS methods, and this reward based sampling for supernet  ...  Figure 4 : 4 Comparisons of clustering performance w.r.t. the number of pairwise constraints on four UCI datasets .  ... 
doi:10.24963/ijcai.2020/437 dblp:conf/ijcai/00010WL20 fatcat:pmbywbnttrbjldqm5g3layhome

Characterizing Y-STRs in the Evaluation of Population Differentiation Using the Mean of Allele Frequency Difference between Populations

Yuxiang Zhou, Yining Yao, Baonian Liu, Qinrui Yang, Zhihan Zhou, Chengchen Shao, Shilin Li, Qiqun Tang, Jianhui Xie
2020 Genes  
On the whole, larger pairwise genetic distances could be obtained using the set with the top fifteen markers from these 23 single-copy Y-STRs, and clear clustering or separation of populations could be  ...  Different configurations were observed in multidimensional scaling (MDS) plots based on pairwise genetic distances evaluated using a Yfiler set and a Yfiler Plus set, respectively.  ...  Pairwise genetic distances of these two marker sets were gauged using Arlequin v3.5 [14] , and a line chart was produced simultaneously.  ... 
doi:10.3390/genes11050566 pmid:32438591 fatcat:vcydqxq72ndrdikwak3yham2ta

Rankr: A Mobile System for Crowdsourcing Opinions [chapter]

Yarun Luon, Christina Aperjis, Bernardo A. Huberman
2012 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
of pairwise comparisons.  ...  Voters do not need to compare and manually rank all of the candidates.  ...  and implementation; and Thomas Sandholm for his thoughtful insights.  ... 
doi:10.1007/978-3-642-32320-1_2 fatcat:wemrhibkfbbajbzc7xc2eipgpu

Clusters and pivots for evaluating a large numberof alternatives in AHP

Alessio Ishizaka
2012 Pesquisa Operacional  
In order to reduce this problem, we present a method with clusters and pivots. This method also helps with a further four problems of the Analytic Hierarchy Process.  ...  It enlarges the comparison scale, facilitates the construction of a consistent or near consistent matrix, eliminates the problem of the choice of the priorities derivation method and allows the use of  ...  CLUSTERS AND PIVOTS Description of the method The clusters and pivots method is useful for application on matrices of high rank, when the number of pairwise comparison becomes overwhelming.  ... 
doi:10.1590/s0101-74382012005000002 fatcat:4ssnriy3b5ehvoxwopa7y6qnfy

Constrained Multi-View Video Face Clustering

Xiaochun Cao, Changqing Zhang, Chengju Zhou, Huazhu Fu, Hassan Foroosh
2015 IEEE Transactions on Image Processing  
Second, our method considers both the video face pairwise constraints as well as the multi-view consistence simultaneously.  ...  To promote the performance of video clustering by multiple intrinsic cues, i.e., pairwise constraints and multiple views, we propose a constrained multi-view video face clustering method under a unified  ...  We effectively exploit the pairwise constraints and the multi-view consistence as regularization simultaneously.  ... 
doi:10.1109/tip.2015.2463223 pmid:26259245 fatcat:sopxi5lcwzh7zomsuo4eixhegm

Discrete Optimisation for Group-Wise Cortical Surface Atlasing

Emma C. Robinson, Ben Glocker, Martin Rajchl, Daniel Rueckert
2016 2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)  
It is assumed that when fully aligned, features will be highly linearly correlated, and thus have low rank.  ...  Group-wise registration is performed through a discrete optimisation framework that seeks to simultaneously improve pairwise correspondences between surface feature sets, whilst minimising a global cost  ...  From this the optimal deformation is then solved as a multilabeling problem using discrete optimisation [20, 8] Registration is optimised so as to simultaneously improve similarity for all pairwise comparisons  ... 
doi:10.1109/cvprw.2016.62 dblp:conf/cvpr/RobinsonGRR16 fatcat:fjwkarb3crcw5j2tuywlsql5o4
« Previous Showing results 1 — 15 out of 39,596 results