检索结果-内蒙古大学图书馆

Block-Structured Optimization for Anomalous Pattern Detection in Interdependent Networks

学校读者我要写书评

暂无评论

Block-Structured Optimization for Anomalous Pattern Detectio...

IEEE International Conference on data Mining (ICDM)

作者： Fei Jie Chunpai Wang Feng Chen Lei Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University at Albany – SUNY Albany NY USA Erik Jonsson School of Engineering & Computer Science The University of Texas at Dallas Dallas TX USA Mininglamp Academy of Sciences Mininglamp Technology Beijing China Institute of Big Knowledge Science Hefei University of Technology Hefei China

We propose a generalized optimization framework for detecting anomalous patterns (subgraphs that are interesting or unexpected) in interdependent networks, such as multi-layer networks, temporal networks, networks of networks, and many others. We frame the problem as a non-convex optimization that has a general nonlinear score function and a set of block-structured and non-convex constraints. We develop an effective, efficient, and parallelizable projection-based algorithm, namely Graph Block-structured Gradient Projection (GBGP), to solve the problem. It is proved that our algorithm 1) runs in nearly-linear time on the network size, and 2) enjoys a theoretical approximation guarantee. Moreover, we demonstrate how our framework can be applied to two very practical applications, and we conduct comprehensive experiments to show the effectiveness and efficiency of our proposed algorithm.

关键词：

Larger, Cheaper, but Faster: SSD-SMR hybrid storage boosted by a new SMR-oriented cache framework 33

学校读者我要写书评

暂无评论

Larger, Cheaper, but Faster: SSD-SMR hybrid storage boosted ...

33rd International Conference on Massive Storage Systems and Technology, MSST 2017

作者： Wang, Chunling Wang, Dandan Chai, Yupeng Wang, Chuanwen Sun, Diansen Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China

By utilizing the new Shingled Magnetic Recording (SMR) technique, the emerging SMR disks achieve higher storage density and lower costs. Together with Flash-based SSDs, SMR disks can be used to construct a new hybrid storage system that is larger, but cheaper than the widely used conventional diskbased storage systems. It is appropriate for the fast growing big data applications which have strict requirements on both capacity and cost, e.g., the scientific computing in the fields of meteorology and astronomy. However, the most serious challenge of the SSD-SMR hybrid storage lies in its weak fine-grained random write performance caused by the write amplification in SMR disks, especially when I/Os are spread randomly across the Logical Block Address (LBA) range of the entire disk. Traditional cache algorithms like LRU usually lead to tens of or even hundreds of times more data written into magnetic plates than the original requests, thus resulting in poor I/O performance, because they do not consider and limit the LBA distribution of the eviction victims at all. Therefore, the cache algorithms for SSD-SMR hybrid storage systems should take this new dimension into account except for the data popularity. In this paper, we propose a new SMR-oriented cache framework, i.e., Partially Open Region for Eviction (PORE), which restricts the LBA range of evicted data from SSD caches appropriately to promote the overall performance of the hybrid storage by making a better tradeoff between the cached data popularity and the SMR write amplification. The experiments based on real-world traces reveal that PORE can boost the SSD-SMR hybrid storage performance by a factor of 3.26∼10.2 with only a 2% SSD cache compared with a conventional disk-based storage on average, while the hybrid storage coupled with LRU is slower than the conventional storage sometimes. PORE makes the hybrid storage much faster than traditional storage besides the advantages on capacity and cost. © 33rd Internati

关键词： Hard disk storage

Residual network with delayed max pooling for very large scale plant identification 18

学校读者我要写书评

暂无评论

Residual network with delayed max pooling for very large sca...

18th Working Notes of CLEF Conference and Labs of the Evaluation Forum, CLEF 2017

作者： Hang, Siang Thye Aono, Masaki Knowledge Data Engineering and Information Retrieval Laboratory Department of Computer Science and Engineering Toyohashi University of Technology Japan

In our approach, we applied a few modifications to the 50-layered Residual Network. Our preliminary experiments with the Plant-CLEF 2016 dataset showed that the modifications improved classification performance. We have trained three models based on the modified Residual Network configuration with different combinations of trusted and noisy PlantCLEF 2017 datasets. Using confidence scores extracted from the three models, we have submitted four runs and our methods showed competitive classification performance.

关键词： Deep learning

CEPV: A Tree Structure Information Extraction and Visualization Tool for Big knowledge Graph

学校读者我要写书评

暂无评论

CEPV: A Tree Structure Information Extraction and Visualizat...

IEEE International Conference on Big knowledge (ICBK)

作者： Shaojing Sheng Peng Zhou Xindong Wu Key Laboratory of Knowledge Engineering with Big Data Heifei Unversity of Technology Ministry of Education Heifei China School of Computer Science and Information Engineering Heifei University of Technology Heifei China School of Computer Science and Technology Anhui University Heifei China Mininglamp Academy of Sciences Mininglamp Technology Beijing China Institute of Big Konowledge Science Heifei University of Technology Heifei China

A large amount of data with rich semantic and structural information has been accumulated in many real-world applications. In order to effectively describe the concepts and connections in these data sets, knowledge graph was proposed as a tool to handle it. The genealogy is a typical tree structure data and can be stored in the knowledge graph. However, due to the complexity and increasing volume of the data, how to efficiently extract and visualize the customized information from the big knowledge graph is hence a challenge and worthy of in-depth study. Motivated by this, we propose a novel user-specified information extraction and visualization tool, named CEPV (the Customized information Extracting, Processing and Visualization tool), for converting the big graph structure data into a specified tree structure display. The main steps of CEPV are as follows: firstly, according to the requirements of users, extracting the specified data from the massive, complex, heterogeneous data as fewer times as possible, which can reduce the frequency of database access and improve the overall efficiency of the algorithm. Secondly, the fault tolerance mechanism and attribute judgment rules are executed to ensure the correctness during the data processing. Finally, the processed data with a complex relationship is presented to the user in multiple visualization models. The high availability and effectiveness of our proposed tool is verified on a big knowledge graph dataset.

关键词： data visualization data mining Tools databases data processing Fault tolerance Fault tolerant systems

Few-shot deep adversarial learning for video-based person re-identification

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wu, Lin Wang, Yang Yin, Hongzhi Wang, Meng Shao, Ling Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei230000 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230000 China University of Queensland St Lucia4072 Australia School of Computer Science and Information Engineering Hefei University of Technology Hefei230000 China Abu Dhabi United Arab Emirates

Video-based person re-identification (re-ID) refers to matching people across camera views from arbitrary unaligned video footages. Existing methods rely on supervision signals to optimise a projected space under which the distances between inter/intra-videos are maximised/minimised. However, this demands exhaustively labelling people across camera views, rendering them unable to be scaled in large networked cameras. Also, it is noticed that learning effective video representations with view invariance is not explicitly addressed for which features exhibit different distributions otherwise. Thus, matching videos for person re-ID demands flexible models to capture the dynamics in time-series observations and learn view-invariant representations with access to limited labeled training samples. In this paper, we propose a novel few-shot deep learning approach to video-based person re-ID, to learn comparable representations that are discriminative and view-invariant. The proposed method is developed on the variational recurrent neural networks (VRNNs) and trained adversarially to produce latent variables with temporal dependencies that are highly discriminative yet view-invariant in matching persons. Through extensive experiments conducted on three benchmark datasets, we empirically show the capability of our method in creating view-invariant temporal features and state-of-the-art performance achieved by our method. Copyright © 2019, The Authors. All rights reserved.

关键词： Recurrent neural networks

Fully-convolutional intensive feature flow neural network for text recognition

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Zhao Tang, Zemin Zhang, Zheng Wang, Yang Qin, Jie Wang, Meng School of Computer Science and Technology Soochow University China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer and Information Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology Shenzhen518055 China Inception Institute of Artificial Intelligence Abu Dhabi United Arab Emirates

The Deep Convolutional Neural Networks (CNNs) have obtained a great success for pattern recognition, such as recognizing the texts in images. But existing CNNs based frameworks still have several drawbacks: 1) the traditaional pooling operation may lose important feature information and is unlearnable;2) the traditional convolution operation optimizes slowly and the hierarchical features from different layers are not fully utilized. In this work, we address these problems by developing a novel deep network model called Fully-Convolutional Intensive Feature Flow Neural Network (IntensiveNet). Specifically, we design a further dense block called intensive block to extract the feature information, where the original inputs and two dense blocks are connected tightly. To encode data appropriately, we present the concepts of dense fusion block and further dense fusion operations for our new intensive block. By adding short connections to different layers, the feature flow and coupling between layers are enhanced. We also replace the traditional convolution by depthwise separable convolution to make the operation efficient. To prevent important feature information being lost to a certain extent, we use a convolution operation with stride 2 to replace the original pooling operation in the customary transition layers. The recognition results on large-scale Chinese string and MNIST datasets show that our IntensiveNet can deliver enhanced recognition results, compared with other related deep models. Copyright © 2019, The Authors. All rights reserved.

关键词： Convolution

Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification

学校读者我要写书评

暂无评论

Learning Structured Twin-Incoherent Twin-Projective Latent D...

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Yulin Sun Zheng Zhang Yang Wang Guangcan Liu Meng Wang School of Computer Science and Technology Soochow University Suzhou China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information and Control Nanjing University of Information Science and Technology Nanjing China

In this paper, we extend the popular dictionary pair learning (DPL) into the scenario of twin-projective latent flexible DPL under a structured twin-incoherence. Technically, a novel framework called Twin-Projective Latent Flexible DPL (TP-DPL) is proposed, which minimizes the twin-incoherence constrained flexibly-relaxed reconstruction error to avoid the possible over-fitting issue and produce accurate reconstruction. In this setting, TP-DPL integrates the twin-incoherence based latent flexible DPL and the joint embedding of codes as well as salient features by twin-projection into a unified model in an adaptive neighborhood-preserving manner. Therefore, TP-DPL can unify the procedures of salient feature representation and classification. The twin-incoherence constraint on coefficients and features can explicitly ensure high intra-class compactness and inter-class separation over them. TP-DPL also integrates the adaptive weighting to preserve local neighborhood of both coefficients and salient features within each class explicitly. For efficiency, TP-DPL selects the Frobenius-norm and abandons the costly l0/l1-norm for group sparse representation. Another byproduct is that TP-DPL can directly apply the class-specific twin-projective reconstruction residual to compute the label of data. Extensive results on public databases show that TP-DPL can deliver the state-of-the-art performance.

关键词：

iSplit LBI: Individualized partial ranking with ties via split LBI

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

Adaptive structure-constrained robust latent low-rank coding for image recovery

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Zhao Wang, Lei Li, Sheng Wang, Yang Zhang, Zheng Zha, Zhengjun Wang, Meng School of Computer Science and Technology Soochow University Suzhou215006 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University of Georgia 549 Boyd GSRC AthensGA30602 Shenzhen China School of Information Science and Technology University of Science and Technology of China Hefei China

In this paper, we propose a robust representation learning model called Adaptive Structure-constrained Low-Rank Coding (AS-LRC) for the latent representation of data. To recover the underlying subspaces more accurately, AS-LRC seamlessly integrates an adaptive weighting based block-diagonal structure-constrained low-rank representation and the group sparse salient feature extraction into a unified framework. Specifically, AS-LRC performs the latent decomposition of given data into a low-rank reconstruction by a block-diagonal codes matrix, a group sparse locality-adaptive salient feature part and a sparse error part. To enforce the block-diagonal structures adaptive to different real datasets for the low-rank recovery, AS-LRC clearly computes an auto-weighting matrix based on the locality-adaptive features and multiplies by the low-rank coefficients for direct minimization at the same time. This encourages the codes to be block-diagonal and can avoid the tricky issue of choosing optimal neighborhood size or kernel width for the weight assignment, suffered in most local geometrical structures-preserving low-rank coding methods. In addition, our AS-LRC selects the L2,1-norm on the projection for extracting group sparse features rather than learning low-rank features by Nuclear-norm regularization, which can make learnt features robust to noise and outliers in samples, and can also make the feature coding process efficient. Extensive visualizations and numerical results demonstrate the effectiveness of our AS-LRC for image representation and recovery. Copyright © 2019, The Authors. All rights reserved.

关键词： Recovery