Censored Composite Conditional Quantile Screening for High-Dimensional Survival Data

In this paper,we introduce the censored composite conditional quantile coefficient(cC-CQC)to rank the relative importance of each predictor in high-dimensional censored regression.The cCCQC takes advantage of all useful information across quantiles and can detect nonlinear effects including interactions and heterogeneity,effectively.Furthermore,the proposed screening method based on cCCQC is robust to the existence of outliers and enjoys the sure screening property.Simulation results demonstrate that the proposed method performs competitively on survival datasets of high-dimensional predictors,particularly when the variables are highly correlated.

Optimal Estimation of High-Dimensional Covariance Matrices with Missing and Noisy Data

The estimation of covariance matrices is very important in many fields, such as statistics. In real applications, data are frequently influenced by high dimensions and noise. However, most relevant studies are based on complete data. This paper studies the optimal estimation of high-dimensional covariance matrices based on missing and noisy sample under the norm. First, the model with sub-Gaussian additive noise is presented. The generalized sample covariance is then modified to define a hard thresholding estimator , and the minimax upper bound is derived. After that, the minimax lower bound is derived, and it is concluded that the estimator presented in this article is rate-optimal. Finally, numerical simulation analysis is performed. The result shows that for missing samples with sub-Gaussian noise, if the true covariance matrix is sparse, the hard thresholding estimator outperforms the traditional estimate method.

Local and global approaches of affinity propagation clustering for large scale data

Recently a new clustering algorithm called 'affinity propagation' (AP) has been proposed, which efficiently clustered sparsely related data by passing messages between data points. However, we want to cluster large scale data where the similarities are not sparse in many cases. This paper presents two variants of AP for grouping large scale data with a dense similarity matrix. The local approach is partition affinity propagation (PAP) and the global method is landmark affinity propagation (LAP). PAP passes messages in the subsets of data first and then merges them as the number of initial step of iterations; it can effectively reduce the number of iterations of clustering. LAP passes messages between the landmark data points first and then clusters non-landmark data points; it is a large global approximation method to speed up clustering. Experiments are conducted on many datasets, such as random data points, manifold subspaces, images of faces and Chinese calligraphy, and the results demonstrate that the two ap-proaches are feasible and practicable.

Similarity measurement method of high-dimensional data based on normalized net lattice subspace

The performance of conventional similarity measurement methods is affected seriously by the curse of dimensionality of high-dimensional data.The reason is that data difference between sparse and noisy dimensionalities occupies a large proportion of the similarity,leading to the dissimilarities between any results.A similarity measurement method of high-dimensional data based on normalized net lattice subspace is proposed.The data range of each dimension is divided into several intervals,and the components in different dimensions are mapped onto the corresponding interval.Only the component in the same or adjacent interval is used to calculate the similarity.To validate this method,three data types are used,and seven common similarity measurement methods are compared.The experimental result indicates that the relative difference of the method is increasing with the dimensionality and is approximately two or three orders of magnitude higher than the conventional method.In addition,the similarity range of this method in different dimensions is [0,1],which is fit for similarity analysis after dimensionality reduction.

Constructing Large Scale Cohort for Clinical Study on Heart Failure with Electronic Health Record in Regional Healthcare Platform:Challenges and Strategies in Data Reuse

Regional healthcare platforms collect clinical data from hospitals in specific areas for the purpose of healthcare management.It is a common requirement to reuse the data for clinical research.However,we have to face challenges like the inconsistence of terminology in electronic health records (EHR) and the complexities in data quality and data formats in regional healthcare platform.In this paper,we propose methodology and process on constructing large scale cohorts which forms the basis of causality and comparative effectiveness relationship in epidemiology.We firstly constructed a Chinese terminology knowledge graph to deal with the diversity of vocabularies on regional platform.Secondly,we built special disease case repositories (i.e.,heart failure repository) that utilize the graph to search the related patients and to normalize the data.Based on the requirements of the clinical research which aimed to explore the effectiveness of taking statin on 180-days readmission in patients with heart failure,we built a large-scale retrospective cohort with 29647 cases of heart failure patients from the heart failure repository.After the propensity score matching,the study group (n=6346) and the control group (n=6346) with parallel clinical characteristics were acquired.Logistic regression analysis showed that taking statins had a negative correlation with 180-days readmission in heart failure patients.This paper presents the workflow and application example of big data mining based on regional EHR data.

Enhancing Relational Triple Extraction in Specific Domains:Semantic Enhancement and Synergy of Large Language Models and Small Pre-Trained Language Models

In the process of constructing domain-specific knowledge graphs,the task of relational triple extraction plays a critical role in transforming unstructured text into structured information.Existing relational triple extraction models facemultiple challenges when processing domain-specific data,including insufficient utilization of semantic interaction information between entities and relations,difficulties in handling challenging samples,and the scarcity of domain-specific datasets.To address these issues,our study introduces three innovative components:Relation semantic enhancement,data augmentation,and a voting strategy,all designed to significantly improve the model’s performance in tackling domain-specific relational triple extraction tasks.We first propose an innovative attention interaction module.This method significantly enhances the semantic interaction capabilities between entities and relations by integrating semantic information fromrelation labels.Second,we propose a voting strategy that effectively combines the strengths of large languagemodels(LLMs)and fine-tuned small pre-trained language models(SLMs)to reevaluate challenging samples,thereby improving the model’s adaptability in specific domains.Additionally,we explore the use of LLMs for data augmentation,aiming to generate domain-specific datasets to alleviate the scarcity of domain data.Experiments conducted on three domain-specific datasets demonstrate that our model outperforms existing comparative models in several aspects,with F1 scores exceeding the State of the Art models by 2%,1.6%,and 0.6%,respectively,validating the effectiveness and generalizability of our approach.

Security Vulnerability Analyses of Large Language Models (LLMs) through Extension of the Common Vulnerability Scoring System (CVSS) Framework

Large Language Models (LLMs) have revolutionized Generative Artificial Intelligence (GenAI) tasks, becoming an integral part of various applications in society, including text generation, translation, summarization, and more. However, their widespread usage emphasizes the critical need to enhance their security posture to ensure the integrity and reliability of their outputs and minimize harmful effects. Prompt injections and training data poisoning attacks are two of the most prominent vulnerabilities in LLMs, which could potentially lead to unpredictable and undesirable behaviors, such as biased outputs, misinformation propagation, and even malicious content generation. The Common Vulnerability Scoring System (CVSS) framework provides a standardized approach to capturing the principal characteristics of vulnerabilities, facilitating a deeper understanding of their severity within the security and AI communities. By extending the current CVSS framework, we generate scores for these vulnerabilities such that organizations can prioritize mitigation efforts, allocate resources effectively, and implement targeted security measures to defend against potential risks.

Scaling up Kernel Grower Clustering Method for Large Data Sets via Core-sets

核栽培者是聚类最近 Camastra 和 Verri 建议的方法的一个新奇的核。它证明为各种各样的数据的好性能关于流行聚类的算法有利地设定并且比较。然而，方法的主要缺点是在处理大数据集合的弱可伸缩能力，它极大地限制它的应用程序。在这份报纸，我们用核心集合建议一个可伸缩起来的核栽培者方法，它是比为聚类的大数据的原来的方法显著地快的。同时，它能处理很大的数据集合。象合成数据集合一样的基准数据集合的数字实验显示出建议方法的效率。方法也被用于真实图象分割说明它的性能。

Large-time Behavior of Solutions for Parabolic Conservation Laws with Large Initial Data

In this paper,we study the large-time behavior of periodic solutions for parabolic conservation laws.There is no smallness assumption on the initial data.We firstly get the local existence of the solution by the iterative scheme,then we get the exponential decay estimates for the solution by energy method and maximum principle,and obtain the global solution in the same time.

A nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix

Problems existin similarity measurement and index tree construction which affect the performance of nearest neighbor search of high-dimensional data. The equidistance problem is solved using NPsim function to calculate similarity. And a sequential NPsim matrix is built to improve indexing performance. To sum up the above innovations,a nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix is proposed in comparison with the nearest neighbor search algorithms based on KD-tree or SR-tree on Munsell spectral data set. Experimental results show that the proposed algorithm similarity is better than that of other algorithms and searching speed is more than thousands times of others. In addition,the slow construction speed of sequential NPsim matrix can be increased by using parallel computing.

Efficient Hierarchical Structure of Wavelet-Based Compression for Large Volume Data Sets

With volume size increasing, it is necessary to develop a highly efficient compression algorithm, which is suitable for progressive refinement between the data server and the browsing client. For three-dimensional large volume data, an efficient hierarchical algorithm based on wavelet compression was presented, using intra-band dependencies of wavelet coefficients. Firstly, after applying blockwise hierarchical wavelet decomposition to large volume data, the block significance map was obtained by using one bit to indicate significance or insignificance of the block. Secondly, the coefficient block was further subdivided into eight sub-blocks if any significant coefficient existed in it, and the process was repeated, resulting in an incomplete octree. One bit was used to indicate significance or insignificance, and only significant coefficients were stored in the data stream. Finally, the significant coefficients were quantified and compressed by arithmetic coding. The experimental results show that the proposed algorithm achieves good compression ratios and is suited for random access of data blocks. The results also show that the proposed algorithm can be applied to progressive transmission of 3D volume data.

Interactive Generalization on Large-Scale Topographical Map Supported by a Database Platform

This paper makes astudy on the interactive digital gener-alization, where map generalizationcan be divided into intellective reason-ing procedure and operational proce-dure, which are done by human andcomputer, respectively. And an inter-active map generalization environmentfor large scale topographic map is thendesigned and realized. This researchfocuses on: ① the significance of re-searching an interactive map generali-zation environment, ② the features oflarge scale topographic map and inter-active map generalization, ③ the con-struction of map generalization-orien-ted database platform.

Deriving Operational Origin-Destination Matrices From Large Scale Mobile Phone Data

A method is presented in this work that integrates both emerging and mature data sources to estimate the operational travel demand in fine spatial and temporal resolutions.By analyzing individuals’mobility patterns revealed from their mobile phones,researchers and practitioners are now equipped to derive the largest trip samples for a region.Because of its ubiquitous use,extensive coverage of telecommunication services and high penetration rates,travel demand can be studied continuously in fine spatial and temporal resolutions.The derived sample or seed trip matrices are coupled with surveyed commute flow data and prevalent travel demand modeling techniques to provide estimates of the total regional travel demand in the form of origindestination(OD)matrices.The methodology is evaluated in a series of real world transportation planning studies and proved its potentials in application areas such as dynamic traffic assignment modeling,integrated corridor management and online traffic simulations.

Dimensionality Reduction of High-Dimensional Highly Correlated Multivariate Grapevine Dataset

Viticulturists traditionally have a keen interest in studying the relationship between the biochemistry of grapevines’ leaves/petioles and their associated spectral reflectance in order to understand the fruit ripening rate, water status, nutrient levels, and disease risk. In this paper, we implement imaging spectroscopy (hyperspectral) reflectance data, for the reflective 330 - 2510 nm wavelength region (986 total spectral bands), to assess vineyard nutrient status;this constitutes a high dimensional dataset with a covariance matrix that is ill-conditioned. The identification of the variables (wavelength bands) that contribute useful information for nutrient assessment and prediction, plays a pivotal role in multivariate statistical modeling. In recent years, researchers have successfully developed many continuous, nearly unbiased, sparse and accurate variable selection methods to overcome this problem. This paper compares four regularized and one functional regression methods: Elastic Net, Multi-Step Adaptive Elastic Net, Minimax Concave Penalty, iterative Sure Independence Screening, and Functional Data Analysis for wavelength variable selection. Thereafter, the predictive performance of these regularized sparse models is enhanced using the stepwise regression. This comparative study of regression methods using a high-dimensional and highly correlated grapevine hyperspectral dataset revealed that the performance of Elastic Net for variable selection yields the best predictive ability.

Mining Frequent Closed Itemsets in Large High Dimensional Data

Large high-dimensional data have posed great challenges to existing algorithms for frequent itemsets mining.To solve the problem,a hybrid method,consisting of a novel row enumeration algorithm and a column enumeration algorithm,is proposed.The intention of the hybrid method is to decompose the mining task into two subtasks and then choose appropriate algorithms to solve them respectively.The novel algorithm,i.e.,Inter-transaction is based on the characteristic that there are few common items between or among long transactions.In addition,an optimization technique is adopted to improve the performance of the intersection of bit-vectors.Experiments on synthetic data show that our method achieves high performance in large high-dimensional data.

Sample-data Decentralized Reliable H∞ Hyperbolic Control for Uncertain Fuzzy Large-scale Systems with Time-varying Delay

这份报纸学习样品数据的问题为有变化时间的延期的不明确的连续时间的模糊大规模系统的可靠 H 夸张控制。第一，模糊夸张模型( FHM )被用来为某些复杂大规模系统建立模型，然后根据 Lyapunov 指导方法和大规模系统的分散的控制理论，线性 matrixine 质量( LMI )基于条件 arederived toguarantee H 性能不仅当所有控制部件正在操作很好时，而且面对一些可能的致动器失败。而且，致动器的精确失败参数没被要求，并且要求仅仅是失败参数的更低、上面的界限。条件依赖于时间延期的上面的界限，并且不依赖于变化时间的延期的衍生物。因此，获得的结果是不太保守的。最后，二个例子被提供说明设计过程和它的有效性。

Study on Tourism Electronic Platform based on Large Data Background

A big scale data poses a great challenge to data storage, management and data analysis. This article analyzes the basic concepts of large data, and mainly used on large data makes the simple contrast. And paper put forward a platform of regional characteristics based on electronic business information publishing system. Finally the paper gives general model and the realization of the platform structure, key technology and process. The platform uses conversion technology of StrutsCX framework based on J2EE platform and the XSLT parsing template of XML document tree that generates and provide automation platform construction features site for the user, it can quickly set up a tourism industry application component with plug-in manner.

Research on thermode of operation of wisdom Logistics in large data background

With the rapid development of China＇ s economy and the accelerating pace of economic globalization, the rapid expansion of trade appears in goods, materials; space to move also will expand in breadth and depth, and thus the efficiency of the logistics activities, rapid response capabilities and the level of information logistics put forward higher requirements. Meanwhile, the logistics needs of personalization, diversification and sophistication, require that logistics service companies must constantly improve and optimize enterprise business model, and target to develop new logistics services to adapt to changes in the logistics market, and improve the competitiveness of enterprises.Modem logistics enterprises refer to the concept of modem logistics as a guide, and the use of modem logistics and organization of modem logistics technology, it is to provide customers help and reduce logistics costs and improve the level of integrated logistics services to rationalize logistics enterprises. Modem logistics enterprises are in terms of philosophy, mode of operation, services, information technology degree, logistics technology, enterprise systems and others have higher requirements to react quickly, service serialization, standardization of operations, the target of systematic, modem means are the features of the organization which are different from the traditional network of logistics enterprises.

Large Data Based Research on the Editing of Film Trailer

Movie trailers originate from the movies themselves. Although compared with the two-hour-long films, the trailers are insignificant. It takes certain skills to make moderate spoilers and sufficient gimmicks in this short period of time, while at the same time to hoist the audience appetite. Films are a result of cutting, so are trailers. But it is obviously insufficient for us to analyze their relationship only from the angle of editing techniques and art. This study is based on the perspective of large data, in which the clips of the trailers are abstracted in visual scenes by comparing the lenses of different tracks in editing software. In this way, we can get the time code of the lenses of the feature. Furthermore, when putting back the time code of the trailers into the movies again, we can have a vivid diagram of the trailers and film by using these time code and directly reveal the relationship between the trailers and the features.

Making Short-term High-dimensional Data Predictable

Making accurate forecast or prediction is a challenging task in the big data era, in particular for those datasets involving high-dimensional variables but short-term time series points,which are generally available from real-world systems.To address this issue, Prof.