Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

32 results about "Group lasso" patented technology

Psychosis automatic discrimination method based on multi-level feature fusion of functional connection networks

The invention proposes a psychosis automatic discrimination method based on multi-level feature fusion of functional connection networks, and the method comprises the steps: constructing the functional connection network by using resting-state functional nuclear magnetic (Rs-fMRI), calculating features of two levels: network attribute features and functional connection features, wherein the network attribute features include six network local attributes and six network global attributes; stacking all functional connection networks all functions to calculate an average network, reserving a certain proportion of edges, and taking the correlation of the reserved positions as the features of the connection hierarchy; simplifying the features of two levels through the group Lasso with the consideration to the independence of brain regions and the correlation between features, and respectively constructing a support vector machine (SVM) classifier, and obtaining a final classification resultin a weighted voting mode. The method realizes automatic discriminant analysis of whether or not suffering from mental illness, and improves the accuracy of diagnosis of psychosis, and the method canbe applied to actual clinical diagnosis.
Owner:CENT SOUTH UNIV

Feature extraction and feature selection method oriented to background multi-source data

A feature extraction and feature selection method oriented to background multi-source data is characterized by including the following steps that first, background data of a plurality of months are divided into a training set and a testing set; second, corresponding grouping features are extracted on the training set according to different source data; third, feature group selection is performed on the testing set through cross validation with a Group Lasso method. The feature extraction and feature selection method oriented to background multi-source data has the advantages that a C45 strategy tree is used for the selected group feature so that a classifier off-network user analysis classifier can be established, the prediction accuracy on off-network users reaches 45%, and the prediction accuracy on downtime users with the off-network tendency reaches 88%.
Owner:NANJING UNIV +1

Spatiotemporal Method for Anomaly Detection in Dictionary Learning and Sparse Signal Recognition

A method for constructing a dictionary to represent data from a training data set comprising: modeling the data as a linear combination of columns; modeling outliers in the data set via deterministic outlier vectors; formatting the training data set in matrix form for processing; defining an underlying structure in the data set; quantifying a similarity across the data; building a Laplacian matrix; using group-Lasso regularizers to succinctly represent the data; choosing scalar parameters for controlling the number of dictionary columns used to represent the data and the number of elements of the training data set identified as outliers; using BCD and PG methods on the vector-matrix-formatted data set to estimate a dictionary, corresponding expansion coefficients, and the outlier vectors; and using a length of the outlier vectors to identify outliers in the data.
Owner:THE UNITED STATES OF AMERICA AS REPRESENTED BY THE SECRETARY OF THE NAVY

Prokaryotic acetylation site prediction method based on information fusion and deep learning

The invention discloses a prokaryotic acetylation site prediction method based on information fusion and deep learning, and relates to the technical field of biological information. According to the prediction method, multi-information fusion is introduced, feature coding is carried out on protein sequences from multiple aspects of sequence information, physicochemical information and evolution information, and the difference between acetylation site and non-acetylation site protein sequences is fully reflected. The original special diagnosis space is screened and optimized by Group Lasso, important features of an acetylation site recognition model are reserved, the optimal feature subset is obtained, and the model calculation speed and quality are improved. The deep neural network generates features with discrimination through hierarchical learning of the optimal feature subset, the acetylation site and the non-acetylation site in the protein sequence are effectively distinguished, the calculation time is saved at the same time, other costs and related limitations are avoided, deep understanding of an acetylation molecular mechanism can be facilitated, and valuable reference information can be provided for experimental verification related to acetylation site recognition.
Owner:QINGDAO UNIV OF SCI & TECH

Self-adaptive Group Lasso-based infrared spectrum wavelength selection method

The invention relates to the technical field of infrared spectrum wavelength, and concretely relates to a convex optimization theory-based novel infrared spectrum wavelength selection method. The method is a self-adaptive wavelength selection method adopting a Group Lasso technology without knowing spectrum partitioning priori knowledge. An infrared spectrum wavelength screening problem is converted into a Group Lasso sparse optimization problem, the sparse structure priori knowledge of the infrared spectrum is fully used to self-adaptively determine the partitioning size, a Shooting rapid algorithm is adopted to calculate the sparse solution, and Belsley colinearity examination of the sparse solution is carried out on the sparse solution to reject wavelength points with small contribution. The method has the advantages of small calculation capacity, few adjustable parameters and strong robustness, can effectively reduce the complexity of a model and improve the generalization performance of the model, and can be widely used in the field of infrared spectrum wavelength selection of a solid phase, a liquid phase and a gas phase.
Owner:ZHONGBEI UNIV

Evaluation method of excess sludge electroosmosis deep dehydration performance

The invention discloses an evaluation method of excess sludge electroosmosis deep dehydration performance, belonging to the technical fields of sewage treatment and solid waste treatment. The method comprises the steps of firstly, collecting a biological sludge sample, and measuring the initial moisture content (IMC), volatile solids (VSS), electrical conductivity (EC), pH value, zeta potential and extracellular polymeric substance (EPS) content of the sludge sample before electroosmosis dehydration is carried out; screening out the key indexes, i.e., EC, Z and EPS, which affect the electroosmosis deep dehydration performance, by using a Group Lasso model; establishing a regression equation based on the key indexes, and calculating according to the regression equation so as to obtain sludge moisture content (FMC) and dehydration rate (DR) after the electroosmosis dehydration is finished. The evaluation method can quantify a complex relationship between residual sludge properties and electroosmosis deep dehydration performance so as to obtain a better prediction result; the result is high in conformity with measured data of the FMC and the DR which are obtained after the electroosmosis dehydration of a simulation device is finished, so that the test work load is greatly reduced, and basis data is provided for further sludge modification.
Owner:NANJING UNIV

Matrix and tensor combined decomposition-based car recommendation method and system

The invention discloses a matrix and tensor combined decomposition-based car recommendation method and system. The method comprises the following steps of constructing a car scoring tensor, constructing a car manufacturer and supplier relationship matrix, and constructing a car product structure tree, wherein the car manufacturer and supplier relationship matrix and the car product structure are both complete and used for assisting in predicting a missing specific value in the tensor; according to the car product structure tree, introducing a tree-guided group lasso model for performing stipulation on a final loss function to obtain a weight; establishing a loss function, and performing iteration on the loss function by using an alternating least square method; performing derivation and zero setting on the loss function, and then calculating an iterative function of the matrix; recovering the tensor, namely complementing a missing value of the tensor; and for different users, based on elements in the complemented tensor X, recommending favorite car types of the users to the users according to a sequence of scores from high to low.
Owner:SHANDONG UNIV

Recommendation method based on heterogeneous information network representation learning

The invention discloses a recommendation method based on heterogeneous information network representation learning, wherein the recommendation method comprises the steps: extracting information, carrying out representation learning on nodes in a heterogeneous information network, wherein the nodes comprise user nodes and project nodes; obtaining low-dimensional vectors of a user and a project; directly docking the low-dimensional vectors of the user and the project with a recommendation task, inputting the low-dimensional vectors as recommended sample features into a domain perception factorization machine model, and carrying out feature selection by adding a group lasso as a regular item to complete score prediction between the user and the project; and completing recommendation according to score prediction. The heterogeneous information network representation learning method based on the meta-structure and the dynamic truncation random walk is adopted, not only can simple linear semantics be captured, but also mining of a complex nonlinear structure can be in order, and the problem of information loss caused by structural defects of a meta-path is effectively solved; and irreversible information loss possibly caused in an information fusion stage is avoided.
Owner:SICHUAN UNIV

Face anti-counterfeiting method based on multi-loss deep fusion

The invention provides a face anti-counterfeiting method based on multi-loss depth combination. Local features and micro-texture features are learned by adopting a plurality of local parallel networks. Meanwhile, in order to further reduce noise learning and improve the robust performance of various data sources, local feature sparsity constraints are enhanced based on the grouping LASSO regularization, sparse processing is conducted on learned features, and the effect of selecting the features is achieved. In addition, the features of the ASPP multi-scale global information module are fused to enhance the model integrating degree. Compared with the prior art, the method has the advantages that the generalization ability of the algorithm is considered from the data set difference, and thetest accuracy of the algorithm model among different data sets is improved while the classification accuracy is ensured.
Owner:WUHAN UNIV

Semi-supervised hash image search method based on Group Lasso

The invention provides a semi-supervised hash image search method based on Group Lasso, and belongs to the field of image search. The method comprises the steps of identifying label images and non-label images in an image database, and pre-processing input images, the label images and the non-label images; according to the pre-processed input images, label images and non-label images, conducting semi-supervised hash learning based on the Group Lasso to obtain binary hash code corresponding to the images; according to the binary hash codes, calculating the Hamming distances between the input images and the images in the image database, and returning the image corresponding to the minimum Hamming distance as an image research result. In the semi-supervised hash image search method based on the Group Lasso, in combination with the condition of current image data, an image data structure can be effectively modeled, a desired image can be quickly and accurately found, and the storage space is greatly saved without storing the image.
Owner:EAST CHINA NORMAL UNIV +1

Multi-fault-feature identification method based on sparse multiperiod-group lasso

The invention discloses a multi-fault-feature identification method based on a sparse multiperiod-group lasso. The multi-fault-feature identification method comprises the following steps that an to-be-identified signal is analyzed so as to construct a binary periodic sequence b, based on a fault feature signal, the between-group sparse characteristic in period groups are presented to obtain a regularization term P (x;b) for promoting between-group sparseness in the period groups, and a sparse multiperiod-group lasso model is established based on discrimination of different fault feature frequencies; controlled optimization operators of a data fidelity term (please see the specifications for the formula) and the regularization term (please see the specifications for the formula) in the sparse multiperiod-group lasso model are constructed correspondingly, through decoupling of the controlled optimization operators, variables are separated, aiming at each controlled optimization operator,the closed-form solution optimized by the controlled optimization operator is established, through iteration, the closed-form solution corresponding to the controlled optimization operator of each fault is solved, and thus model solving is achieved; regularization parameters are set adaptively through simulation signal counting and analyzing, the adaptive solution of the algorithm is obtained through the parameters, and thus each fault is obtained through separation; and aiming at each fault obtained through separation, the fault type is identified through envelope analysis.
Owner:XI AN JIAOTONG UNIV

Feature extraction and feature selection methods for background multi-source data

A feature extraction and feature selection method for background multi-source data is characterized in that it includes the following steps: (1) dividing training sets and test sets on the background data of multiple months; (2) training sets for different Extract the corresponding group features from the source data; (3) Use the Group Lasso method to select feature groups through cross-validation on the test set. The beneficial effects of the present invention are as follows: for the selected group features, the C45 decision tree is used to establish a classifier for off-network user analysis classifier, and the accuracy rate of off-network user prediction reaches 45%. The accuracy rate reached 88%.
Owner:NANJING UNIV +1

Cancer classification and characteristic gene selection method

The invention belongs to the field of biological information, and discloses a cancer classification and characteristic gene selection method, which comprises the following steps of: establishment of a primary learner: establishing T logistic regression models and a spark group lasso regularized loss function solving model corresponding to the T logistic regression models, and outputting a secondary learner training set; establishing a secondary learner: establishing a multi-response regression model and a loss function solving model corresponding to L1 regularization, and outputting a training set prediction result; and a prognosis feature selection model: establishing a prognosis feature selection SGL model. According to the cancer classification and feature gene selection method, the three standards of prediction, stabilization and selection are met, the accuracy and stability of the model on cancer classification prediction are improved through stacking integration, oncogenes and cancer-related genes are accurately selected, and the interpretability of the model is enhanced; gene and gene pathway priori knowledge are fused, and the accuracy of cancer classification and the effectiveness of feature selection are improved.
Owner:NANCHANG UNIV

Modular feature selection method for brain disease classification

The invention discloses a modular feature selection method (MLFS for short) for brain disease classification, and the method comprises the following steps: carrying out the preprocessing of a functional magnetic resonance image, and dividing a brain into a pre-designated brain region; extracting an average time sequence corresponding to all brain regions and constructing a functional brain map; searching modular structure information by using a signed spectral clustering algorithm; and selecting a discriminative feature through a group LASSO method based on modularization, wherein a support vector machine (SVM) is used for classification. According to the embodiment of the invention, the discriminative features in the brain map can be clearly identified by using modular information, and the method is used for brain disease classification, and has a certain reference value for studying cognitive impairment of the brain.
Owner:LIAOCHENG UNIV

Semi-supervised Hash image search device based on Group Lasso

The invention provides a semi-supervised Hash image search device based on Group Lasso, and belongs to the field of image search. The device comprises a preprocessing module, a training learning module and a calculation module, wherein the preprocessing module is used for identifying a tag image and a non-tag image in an image database, and preprocessing an input image, the tag image and the non-tag image; the training learning module is used for carrying out semi-supervised Hash learning based on the Group Lasso according to the preprocessed input image, tag image and non-tag image to obtain a binary Hash code corresponding to each image; and the calculation module is used for calculating a Hamming distance between the input image and each image in the image database according to the binary Hash code, and returning the image corresponding to a minimum Hamming distance as an image search result. In the device, an existing image data situation can be combined to effectively carry out modeling on an image data structure, required images can be quickly and accurately searched, the image does not need to be stored, and a storage space is greatly saved.
Owner:EAST CHINA NORMAL UNIV +1

Systems and methods for block-sparse recurrent neural networks

Described herein are systems and methods to prune deep neural network models in reducing the overall memory and compute requirements of these models. It is demonstrated that using block pruning and group lasso combined with pruning during training, block-sparse recurrent neural networks (RNNs) may be built as accurate as dense baseline models. Two different approaches are disclosed to induce blocksparsity in neural network models: pruning blocks of weights in a layer and using group lasso regularization to create blocks of weights with zeros. Using these techniques, it is demonstrated that block-sparse RNNs with high sparsity can be created with small loss in accuracy. Block-sparse RNNs eliminate overheads related to data storage and irregular memory accesses while increasing hardware efficiency compared to unstructured sparsity.
Owner:BAIDU USA LLC

A multi-fault feature identification method based on sparse multi-period group lasso

The invention discloses a multi-fault-feature identification method based on a sparse multiperiod-group lasso. The multi-fault-feature identification method comprises the following steps that an to-be-identified signal is analyzed so as to construct a binary periodic sequence b, based on a fault feature signal, the between-group sparse characteristic in period groups are presented to obtain a regularization term P (x;b) for promoting between-group sparseness in the period groups, and a sparse multiperiod-group lasso model is established based on discrimination of different fault feature frequencies; controlled optimization operators of a data fidelity term (please see the specifications for the formula) and the regularization term (please see the specifications for the formula) in the sparse multiperiod-group lasso model are constructed correspondingly, through decoupling of the controlled optimization operators, variables are separated, aiming at each controlled optimization operator,the closed-form solution optimized by the controlled optimization operator is established, through iteration, the closed-form solution corresponding to the controlled optimization operator of each fault is solved, and thus model solving is achieved; regularization parameters are set adaptively through simulation signal counting and analyzing, the adaptive solution of the algorithm is obtained through the parameters, and thus each fault is obtained through separation; and aiming at each fault obtained through separation, the fault type is identified through envelope analysis.
Owner:XI AN JIAOTONG UNIV

A Group Lasso-Based Neural Network Pruning Method for Power Amplifiers

The invention discloses a Group Lasso-based neural network clipping method for a power amplifier, which belongs to the technical field of communication. First, for the original neural network structure, all the output weights connected to the same neuron in the other layers except the output layer are grouped into one group; after grouping, L is performed on each group of weights separately. 2 norm constraint; then L of the weights of all groups in the original neural network structure 2 The sum of the norms is added to the original loss function Loss as a Group Lasso penalty 1 After that, get a new loss function Loss 2 ; Through the BP algorithm to Loss 2 Minimize the training, find the weight groups whose convergence is close to 0, and remove the neurons connected by these weight groups to obtain a simplified neural network, and use the BP algorithm to analyze the original loss function Loss 1 Perform training to obtain a simplified neural network model after training, and use the model to model or predistort the power amplifier. The invention can suppress the overfitting in the training process, improve the pre-distortion effect, reduce the amount of calculation, and is convenient for engineering application.
Owner:BEIJING UNIV OF POSTS & TELECOMM +1

A semi-supervised hash image search method based on group Lasso

The invention provides a semi-supervised hash image search method based on Group Lasso, which belongs to the field of image search. The method includes: identifying label images and non-label images in an image database, preprocessing input images, label images and non-label images; performing Group Lasso based on the preprocessed input images, label images and non-label images Semi-supervised hash learning obtains the binary hash code corresponding to each image; calculates the Hamming distance between the input image and each image in the image database according to the binary hash code, and returns the image corresponding to the minimum Hamming distance as the image search result. In the present invention, the image data structure can be effectively modeled in combination with the status of the existing image data, and the required image can be quickly and accurately searched without storing the image itself, which greatly saves storage space.
Owner:EAST CHINA NORMAL UNIV +1

A Grouping Method of Group Lasso Characteristic Based on Network Analysis

The invention discloses a method for clustering lasso cluster characteristics based on network analysis, which is mainly used for solving the clustering of related expressed genes in bioengineering and establishing a lasso cluster model by using the method. The method comprises the steps of firstly, dividing experimental data into a positive data set and a negative data set, and respectively establishing a weighting co-expression gene network (adjacent matrix) corresponding to the positive data set or the negative data set; secondly, determining important network modules respectively corresponding to a positive sample and a negative sample; thirdly, simplifying a positive sample network module by utilizing a negative sample network module according to the experiment background; finally, clustering the characteristics according to the simplified positive sample network module, and establishing a lasso cluster and a promotion model of the lasso cluster according to the clustering. According to the method disclosed by the invention, the characteristic clustering of the lasso cluster is successfully and organically combined with module selection of network analysis, the operation is easy, the clustering method can be applied to screening of related genes in liver regenerative cell proliferation, and the method has an important application value in simulating a cell proliferation process of complicated diseases such as liver cirrhosis and cancer and screening new drugs.
Owner:HENAN NORMAL UNIV

Method for classifying resting state functional magnetic resonance image data

The invention relates to an image processing technology, in particular to a resting-state functional magnetic resonance image data classification method, which is based on a tree structure group lasso hypergraph U-Net model, and is realized by adopting the following steps: S1, preprocessing a resting-state functional magnetic resonance image; s2, carrying out region segmentation on the preprocessed resting state functional magnetic resonance image according to the selected standardized brain map, and carrying out average time sequence extraction on each segmented brain region; s3, calculating the correlation degree between every two average time sequences of each brain region by adopting a Pearson's correlation method so as to obtain a correlation matrix, and selecting a correlation coefficient value of a triangle on the matrix as a brain network feature of each subject; the method is suitable for magnetic resonance image data classification.
Owner:TAIYUAN UNIV OF TECH

A semi-supervised hash image search device based on group Lasso

The invention provides a semi-supervised hash image search device based on Group Lasso, which belongs to the field of image search. The device includes: a preprocessing module, used to identify label images and non-label images in the image database, and preprocess the input image, label image and non-label image; Image, label image and non-label image are based on Group Lasso semi-supervised hash learning to obtain the binary hash code corresponding to each image; the calculation module is used to calculate the relationship between the input image and each image in the image database according to the binary hash code. Hamming distance, and returns the image corresponding to the minimum Hamming distance as the image search result. In the present invention, the image data structure can be effectively modeled in combination with the status of the existing image data, and the required image can be quickly and accurately searched without storing the image itself, which greatly saves storage space.
Owner:EAST CHINA NORMAL UNIV +1

Genotype-phenotype association analysis method in multi-omics data based on small sample

ActiveCN113192556BSolve the problem that the eigenvalues ​​are too large to be effectively regressedImprove forecast accuracyBiostatisticsProteomicsGenotypeGene association
A small-sample-based genotype-phenotype association analysis method in multi-omics data is disclosed, which specifically includes the following steps: generating a weighted undirected gene association graph using protein networks and gene expression values, and using the SPICi clustering method to The undirected graph is clustered to generate gene clusters; the gene clusters are screened by the group Lasso method; the SNP clusters corresponding to the screened gene clusters are obtained through the eQTL data; each SNP cluster, the corresponding gene cluster and the phenotype It is constructed as a three-layer network class block, and the sparse partial least squares method is used for regression operation on the relationship between SNP and gene in each class block, and logistic regression is used for operation on the relationship between gene and phenotype; The results are averaged to obtain the final prediction result. The invention can solve the problem that the eigenvalue is huge and cannot be effectively returned under the condition of small samples in the three-layer network; the prediction accuracy rate is improved; the biological meaning is clearer; and the tissue specificity is considered.
Owner:NORTHWESTERN POLYTECHNICAL UNIV +1

A method for evaluating the performance of electroosmotic deep dewatering of excess sludge

The invention discloses an evaluation method of excess sludge electroosmosis deep dehydration performance, belonging to the technical fields of sewage treatment and solid waste treatment. The method comprises the steps of firstly, collecting a biological sludge sample, and measuring the initial moisture content (IMC), volatile solids (VSS), electrical conductivity (EC), pH value, zeta potential and extracellular polymeric substance (EPS) content of the sludge sample before electroosmosis dehydration is carried out; screening out the key indexes, i.e., EC, Z and EPS, which affect the electroosmosis deep dehydration performance, by using a Group Lasso model; establishing a regression equation based on the key indexes, and calculating according to the regression equation so as to obtain sludge moisture content (FMC) and dehydration rate (DR) after the electroosmosis dehydration is finished. The evaluation method can quantify a complex relationship between residual sludge properties and electroosmosis deep dehydration performance so as to obtain a better prediction result; the result is high in conformity with measured data of the FMC and the DR which are obtained after the electroosmosis dehydration of a simulation device is finished, so that the test work load is greatly reduced, and basis data is provided for further sludge modification.
Owner:NANJING UNIV

Small sample-based genotype and phenotype association analysis method in multi-omics data

ActiveCN113192556ASolve the problem that the eigenvalues ​​are too large to be effectively regressedImprove forecast accuracyBiostatisticsProteomicsGene associationProtein
The invention discloses a small sample-based genotype and phenotype correlation analysis method in multi-omics data. The method specifically comprises the following steps: generating a weighted undirected gene association graph by using a protein network and a gene expression value, and clustering the undirected graph by using an SPICi clustering method to generate a gene cluster; screening the gene clusters by using a group Lasso method; obtaining an SNP cluster corresponding to the screened gene cluster through the eQTL data; constructing each SNP cluster, the corresponding gene cluster and the phenotype into a three-layer network class block, performing regression operation on the association relationship between the SNP and the gene in each class block by adopting a sparse partial least square method, and performing operation on the association relationship between the gene and the phenotype by adopting logistic regression; and averaging the obtained prediction results of the blocks to obtain a final prediction result. The method can solve the problem that effective regression cannot be realized due to huge characteristic values under the condition of small samples in a three-layer network; wherein the prediction accuracy is improved, the biological significance is clearer and tissue specificity is considered.
Owner:NORTHWESTERN POLYTECHNICAL UNIV +1

High-order factor decomposer method based on sparse group Lasso

The invention relates to an enhancement strategy of a high-order factor decomposer model, in particular to a high-order factor decomposer method (simply written as SGL-HOFM) based on sparse group Lasso. The high-order factor decomposer method is characterized in that a Sparse Group Lasso-based regular item is adopted for a special intersection item structure of a high-order factor decomposition machine instead of a traditional two-norm, and a new model can realize sparse structure of features and play a role in feature selection. After the high-order factor decomposer method is adopted, the number of parameters of the model is obviously reduced, so that the required storage space is reduced; due to the fact that noise is removed through feature selection, the performance of the model is improved; and the high-order factor decomposer method can be widely applied to the field of data mining, such as classification, regression, sorting, feature analysis, a recommendation system and socialnetwork analysis, and is particularly suitable for solving the analysis problem containing large-scale sparse high-dimensional data.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS

A Robustness Evaluation Method of Brain Function Supernetwork Model

ActiveCN111754395BRobust Effective AnalysisImplementing Disorder SimulationsImage enhancementImage analysisAlgorithmImage manipulation
The invention relates to an image processing technology, in particular to a robustness evaluation method based on a brain function super-network model. The method is realized by the following steps: Step S1: Preprocessing a resting state functional magnetic resonance image, and extracting The average time series of each brain region; Step S2: solve the sparse linear regression model based on the covering group lasso method, thereby obtaining the brain function supernetwork model; Step S3: calculate the properties of the brain function supernetwork; The network model simulates the failure process of the brain function super-network; Step S5: Calculate the global efficiency and the relative size of the maximum connected subgraph according to the brain function super-network model after the failure; Step S6: Evaluate the robustness of the brain function super-network. This method evaluates the robustness of the brain function super-network model on the basis of truly representing the complex multivariate interactive relationship of the human brain, so as to realize the functional disorder simulation of brain disease states in the complex multivariate interactive environment.
Owner:TAIYUAN UNIV OF TECH

Car recommendation method and system based on joint decomposition of matrix and tensor

The invention discloses a matrix and tensor combined decomposition-based car recommendation method and system. The method comprises the following steps of constructing a car scoring tensor, constructing a car manufacturer and supplier relationship matrix, and constructing a car product structure tree, wherein the car manufacturer and supplier relationship matrix and the car product structure are both complete and used for assisting in predicting a missing specific value in the tensor; according to the car product structure tree, introducing a tree-guided group lasso model for performing stipulation on a final loss function to obtain a weight; establishing a loss function, and performing iteration on the loss function by using an alternating least square method; performing derivation and zero setting on the loss function, and then calculating an iterative function of the matrix; recovering the tensor, namely complementing a missing value of the tensor; and for different users, based on elements in the complemented tensor X, recommending favorite car types of the users to the users according to a sequence of scores from high to low.
Owner:SHANDONG UNIV

A Method of Infrared Spectrum Wavelength Selection Based on Adaptive Group Lasso

The invention relates to the technical field of infrared spectrum wavelength, and concretely relates to a convex optimization theory-based novel infrared spectrum wavelength selection method. The method is a self-adaptive wavelength selection method adopting a Group Lasso technology without knowing spectrum partitioning priori knowledge. An infrared spectrum wavelength screening problem is converted into a Group Lasso sparse optimization problem, the sparse structure priori knowledge of the infrared spectrum is fully used to self-adaptively determine the partitioning size, a Shooting rapid algorithm is adopted to calculate the sparse solution, and Belsley colinearity examination of the sparse solution is carried out on the sparse solution to reject wavelength points with small contribution. The method has the advantages of small calculation capacity, few adjustable parameters and strong robustness, can effectively reduce the complexity of a model and improve the generalization performance of the model, and can be widely used in the field of infrared spectrum wavelength selection of a solid phase, a liquid phase and a gas phase.
Owner:ZHONGBEI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products