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

45 results about "Sparse data sets" patented technology

A user similarity-based sparse data collaborative filtering recommendation method

The invention provides a user similarity-based sparse data collaborative filtering recommendation method and mainly aims to solves the problems in the prior art that the calculation of the values of similarity between users is in accurate for sparse data and further the recommendation quality is influenced. The method comprises the steps of (1) establishing a sparse matrix for item scores from users; (2) calculating the overall situation similarity between any two items; (3) calculating the local similarity between any two user scores; (4) calculating the similarity between any two users; (5) predicting scores; (6) generating a recommendation list; (7) completing collaborative filtering item recommendation for all the users. Experimental simulation results show that for sparse data sets, the method has the advantages of guaranteeing higher accuracy of the similarity between users, improving the recommendation quality and better meeting user requirements compared with conventional collaborative filtering recommendation methods.
Owner:XIDIAN UNIV

K-anonymous privacy protection method adopting density-based partition

The invention discloses a k-anonymous privacy protection method adopting density-based partition, namely, a DBTP-MDAV (density-based twice partition-MDAV) method, and relates to the technical field of anonymous privacy protection. The method comprises the steps of firstly performing primary division on an original data set by using a density-based method to obtain aggregated clusters with relatively high tuple similarity; and secondly, performing secondary division on the aggregated clusters by using a classic micro-aggregation method, thereby enabling the data set to reach optimal k partition and reducing information loss of an anonymous process. Through a large amount of experiments, the proposed DBTP-MDAV method can effectively reduce the information loss of the anonymous process and improve the availability of the released data set. The method has remarkable advantages for performing anonymous processing on a sparse data set.
Owner:XUZHOU MEDICAL UNIV

Binocular parallax estimation method introducing attention map

The invention discloses a binocular parallax estimation method introducing an attention map, and particularly relates to a method for obtaining global information, generating an attention map and guiding binocular parallax estimation by using deep learning data learning capability. According to the attention map provided by the invention, the global features and semantic structures of an image arebetter extracted by leading out independent branches, the obtained attention map acts on the cost in a weighted mode to play a role in matching and guiding, and it is ensured that regions with the same semantic structure have parallax in smooth distribution. Meanwhile, the invention provides a strategy for fine adjustment based on sparse labels. Different supervision strategies are adopted in different fine adjustment stages, the optimal effect of the method can be achieved on a sparse data set through reconstruction error guidance, sparse correction and smooth constraint optimization, and the problem that the effect of a label-free area is poor is solved.
Owner:DALIAN UNIV OF TECH +1

Systems and methods for enhanced accuracy in OCT imaging of the cornea

Systems and methods for enhanced accuracy in optical coherence tomography imaging of the cornea are presented, including approaches for more accurate corneal surface modeling, pachymetry maps, keratometric values, and corneal power. These methods involve new scan patterns, an eye tracking mechanism for transverse motion feedback, and advanced motion correction algorithms. In one embodiment the methods comprise acquiring a first sparse set of data, using that data to create a corneal surface model, and then using the model to register a second set of denser data acquisition. This second set of data is used to create a more accurate, motion-corrected model of the cornea, from which pachymetry maps, keratometric values, and corneal power information can be generated. In addition, methods are presented for determining simulated keratometry values from optical coherence tomography data, and for better tracking and registration by using both rotation about three axes and the corneal apex.
Owner:CARL ZEISS MEDITEC INC

An update generation method of fuzzy concept lattice

The invention relates to a method for generating a complete fuzzy concept lattice, in particular to a lattice updating method for fuzzy concepts based on an integration technology, which uses the integration scheme between two fuzzy concept lattices to solve the problem of L-Fuzzy Concept Lattice Renewal. The invention does not need to regenerate the complete L from the updated data set. Fuzzy concept lattice, and the original fuzzy concept lattice before updating is used in the generation of new fuzzy concept lattice, which avoids the waste of resources and improves the Updating efficiency ofL-fuzzy concept lattice. The invention avoids regenerating the fuzzy concept lattice from the updated formal background, and updates the original fuzzy concept lattice by using the update data, so the update efficiency is greatly improved. Especially for sparse dataset and small truth degree set, the update efficiency is improved obviously.
Owner:ZHENGZHOU UNIV +1

Sparse Datatable Data Structure

A sparse dataset structure is created by creating column vectors for one or more columns in a dataset that have at least one significant value. Each column vector includes data values for columns of the dataset. Each column vector that is a sparse column vector includes a look-up index array and a value array. Entries in the look-up index array represent columns. The value array includes values for a row in a column. Each entry in the value array points to a row entry in the look-up index array. A side structure includes a row index and a column index. The row index includes a location for an entry for each row where entries point to a location in the column index that identifies a column that has a first significant entry for a row. Alternatively a sparse dataset could be constructed with sparse rows.
Owner:MICROSOFT TECH LICENSING LLC

Systems and/or methods for machine-learning based data correction and completion in sparse datasets

Certain example embodiments herein relate to techniques for automatically correcting and completing data in sparse datasets. Records in the dataset are divided into groups with properties having similar values. For each group, one or more properties of the records therein that is / are to be ignored is / are identified, based on record distances relative to the records in the group, and distances among values for each of the properties of the records in the respective group. The records in the groups are further divided into sub-groups without regard to the one or more properties that is / are to be ignored. The sub-groups include a smaller and more cohesive set of records. For each sub-group: based on the records therein, predicted values to be applied to values identified as being empty but needing to be filled in are determined; and those predicted values are applied. The corrected / completed dataset is provided as output.
Owner:SOFTWARE AG

Privacy protection association rule mining method based on sparse data set

The invention discloses a privacy protection association rule mining method based on a sparse data set, and mainly solves the problems that an existing mining method needs to introduce additional calculation overhead and privacy leakage. The scheme comprises the following steps: 1) initializing a system; 2) enabling the data owner to encrypt the uploaded data; 3) enabling a data miner to encrypt, upload and query; 4) performing double-cloud calculation on an inner product ciphertext set of query and transaction, and calculating a support degree ciphertext of query; 5) comparing the support degree with a support degree threshold value by the double-cloud security; (6) enabling the data miner to decrypt the mining result, judge whether the mining result is a frequent item set or not, solve a non-empty proper subset of the frequent item set, and querying, encrypting and uploading the non-empty proper subset and the query; 7) comparing the confidence coefficient with a confidence coefficient threshold value by the double-cloud security; and 8) enabling the data miner to decrypt the mining result and judge whether the mining result belongs to the strong association rule. According to the invention, the risk of privacy disclosure is reduced, and higher privacy protection requirements can be met; and meanwhile, the mining calculation efficiency is effectively improved.
Owner:XIDIAN UNIV

Scalable configurable universal full spectrum cyber process that utilizes measure points from sensor observation-derived representations or analytically rich sparse data sets for making cyber determinations regarding or utilizing sensor observations or sensor observations subjects

A scalable configurable universal full spectrum cyber process that utilizes measure points from sensor observation-derived representations or analytically rich sparse data sets for making selected cyber determinations regarding or utilizing sensor observations or sensor observation subjects. Utilizing necessary cyber resources and predetermined criteria for making selected cyber determinations regarding or utilizing the sensor observation or at least one sensor observation subject, the disclosed cyber process employs the use of measure points for accurately or reliably locating selected analytically rich indicators from sensor observation-derived representations, wherein appropriate informational representations or measurements regarding or utilizing the selected analytically rich indicators, the measure points or the sensor observation are assigned and stored in analytically rich sparse data sets where they may be utilized by the cyber process for making, in real time or at any time thereafter, selected cyber determinations regarding or utilizing sensor observations or sensor observation subjects.
Owner:ARONSON JEFFRY DAVID
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products