81 results about "Item set mining" patented technology

The invention provides a method for building an alarm association rule mining system based on a maximal frequent item set DM (Data Mining) and the realization of that. Three different mining ways for single equipment, cognate equipment and linked equipment are designed aiming to different types of equipment in a communication network, and according to the mining range, the DM range can be positioned at specific city level or communication equipment manufacturer level; after the mining way is confirmed, the alarm association time window, the sliding step, etc are selected to acquire an alarm affair set assembly; and alarm association result mining is performed by utilizing the maximal frequent item set mining algorism after a user inputs the minimum support, and mining result treatment and display are performed according to different mining ways. Through the mentioned steps, the alarm association rule needed by the user can be found out from plenty of alarm data. The method has broad application prospect and favorable utility value.

The invention discloses a question sentence template automatic generation method and apparatus, and belongs to the technical field of intelligent question and answer. The method comprises the steps ofpreparing question sentence log corpora; performing word segmentation and part-of-speech tagging on the log corpora; performing named entity identification and replacement; performing semantic replacement; and performing frequent item set mining, and generating a question sentence template. According to the method and the apparatus, the question sentence template generation efficiency is improved; a large amount of labor resources are saved; the generated question sentence template can be assessed; a question sentence template library is autonomously and continuously expanded; and the qualityof a knowledge base of an intelligent question and answer system is improved.

The invention discloses a computer neural network modified according to a pruning method. The method includes: as for a pre-trained neural network, constructing a plurality of item sets from network parameters, adopting an improved similar Apriori algorithm for frequency item set mining according to significances of the item sets to obtain a set of important item sets, and constructing a pruned neutral network according to the obtained item sets, and finally re-training the pruned neural network to obtain a final result.

The invention discloses a denormalization strategy selection method based on the frequent item set mining algorithm and particularly relates to a denormalization strategy selection method for mass data sets based on the frequent item set mining algorithm. The frequent pattern mining method is applied to guiding database denormalization for the first time; based on the frequent pattern mining algorithm of a concise tree, a brand-new process of establishing the concise tree and a correct counting method, serving for database denormalization selection, are provided. The denormalization strategy selection method based on the frequent item set mining algorithm has the advantages that through the frequent item set mining algorithm of association rules, important association or relation of item sets in mass data is discovered to guide DBA and the like to select and build denormalization strategies of databases, and the problem of performance bottleneck caused by mass table joins in the mass data is solved.

The invention discloses a method of item-all-weighted positive or negative association model mining between text terms and a mining system applied to the method. The method comprises the following steps of preprocessing by using a Chinese text preprocessing module to establish a text database and a feature word item library; mining item-all-weighted feature word candidate item sets from the text database by utilizing a feature word frequent item set and negative item set mining implementation module, calculating a weight dimension ratio, and cutting out uninteresting item sets by adopting a multi-interestingness threshold value pruning strategy to obtain an interesting item-all-weighted feature work frequent item set and negative item set model; mining an effective item-all-weighted positive or negative association rule model from frequent item sets and negative item sets by utilizing an item-all-weighted positive or negative association rule mining implementation module between terms, and outputting the mined positive or negative association rule model to a user by utilizing an item-all-weighted association model result display module between terms. By applying the method and the system, unnecessary frequent item sets, negative item sets and association rule models can be greatly reduced, Chinese feature word association rule mining efficiency is improved and a high-quality association model between Chinese terms is obtained.

The invention discloses a frequent item set mining method and system supporting differential privacy, and belongs to the field of computer data privacy protection and data mining. The method comprises the steps of processing an original data set by adopting a transaction truncation method, and avoiding privacy leakage in the truncation process by using an exponential difference mechanism-based method; then constructing a tree structure, wherein each node corresponds to an item of a transaction, frequent information on the transaction is stored in a node corresponding to the last item of the transaction, and the support degree of each node is initialized by using Laplace noise to avoid the privacy leakage in the tree construction process; and converting the constructed tree into an FP tree, so that a frequent item set can be mined by using an FP-Growth method. According to the method and the system, the released frequent item set can meet security demands of the differential privacy; compared with an original frequent item set, the released frequent item set has relatively high similarity with the original frequent item set and relatively high data availability; and compared with a conventional algorithm, higher efficiency is achieved.

The invention discloses a recommendation method in combination with a frequent item set and deep learning under a big data environment. The recommendation method includes the following steps that behavior records of a user are collected, and a MapReduce parallel computation model is used for mining the frequent item set from the behavior records; a deep learning network is established, and the frequent item set is used for training the network; when recommendation is needed for the user, the behavior records of the user are collected as input, the established deep learning network is used for computation, and items are selected to be recommended to the user, wherein results of the items are larger than a threshold value. Based on the MapReduce parallel computation model, frequent item set mining can be efficiently performed inside a distributed system, with the frequent item set being a sample, the deep learning network is established, trained and used for recommendation, and compared with the mode that the frequent item set and a traditional neural network are directly utilized, recommendation can be performed for the user more accurately.

The embodiment of the invention provides an abnormal group identification method and device. The method comprises the steps of obtaining a feature value of each user to be analyzed in a plurality of users to be analyzed; Determining a high-frequency characteristic value and a low-frequency characteristic value in the characteristic values of the users to be analyzed; Mining a maximum frequent itemset according to the high-frequency characteristic value of each to-be-analyzed user and a preset frequent item set mining strategy, and obtaining a low-frequency maximum frequent characteristic value in the maximum frequent item set; Constructing a target bipartite graph according to the low-frequency maximum frequent characteristic value and the low-frequency characteristic value in the characteristic values of the users to be analyzed, and defining the weight of an edge in the target bipartite graph; And determining an abnormal group in the to-be-analyzed user according to the weight of the edge in the target bipartite graph and a clustering result of a plurality of to-be-analyzed users obtained by performing graph clustering on the target bipartite graph. According to the embodiment of the invention, the accuracy of abnormal group recognition is improved, and the steps are simple and easy to execute.

The invention relates to a privacy protection method based on the Location Based Service, which utilizes the differential privacy protection to protect various privacy information in the LBS data to the maximum extent without addingexcessive 'noise'and affecting the quality of service. Compared to traditional privacy protection, differential privacy protection can resist various forms of attacks with the attacker's greatest background knowledge. The method achieves the maximum benefit of privacy protection by virtue of this great advantage of differential privacy protection. In this method, anexponential mechanism is used on the coding mechanism to convert the coordinates of the three-dimensional space into an entity object; an interactive publishing mechanism is used for data publishing;an IDC Framework is used to reduce the costly privacy protection budget, thereby reducing the total amount of 'noise'; in the aspect of data mining in the query end, a frequent item set mining methodsuitable for the 3Ddata sets-PrivBasis is adopted, which can realize the differential privacy protection under the the premise of ensuring the computing performance.

The invention discloses a multi-computing framework processing system applied in big data and an association rule mining method thereof. The system comprises a distributed computer cluster, a mapreduce system framework and a spark system framework sharing the distributed computer cluster. The computer cluster comprises a database cluster forming transactional databases, a switch, an application server, a Hadoop cluster, and a Spark cluster. Clusters are used to distribute computational tasks. Using advantages of multi-node parallel computation and distributed storage, multi-computing framework and the association rule mining algorithm are combined, transaction cluster division and a pruning strategy are combined, and data handling capacity is reduced, so processing efficiency is effectively improved. Through directly scanning value, a conditional pattern base is solved. The system has large improvement on aspect of overcoming limitation of shared memory, so computing resources are distributed in a balanced manner. The method effectively solves a problem that a conventional item-set mining algorithm is inadequate in computation and storage capability.

The invention relates to an uncertain data model oriented utility item set mining method. The method comprises the steps of S1, verifying transaction weighting utility and expected support degree of each item set and forming a total candidate set by taking item sets passing the verification as candidate sets; and S2, verifying the utility of each item set in the total candidate set through an uncertain data model to obtain an uncertainty based high-utility item set, wherein the transaction weighting utility is equal to the sum of transaction utilities of all transactions containing the item sets in the uncertain data model, the item sets forming the total candidate set include a k-item set verified through the step S1, k is 1-n, n is an item number of the transaction with the most items in the uncertain data model, and when k is greater than 1, the k-item set is obtained by using a k-1-item set in the total candidate set as a subset and performing verification through the step S1. According to the method, an optimization method is added in an existing mining method, so that the technical effects of reducing resource consumption and shortening running time are achieved.

The invention relates to the technical field of data mining, and discloses a large-scale vehicle-passing data oriented accompanying vehicle identification method. The large-scale vehicle-passing data oriented accompanying vehicle identification method comprises the steps of converting the vehicle-passing data into accompanying data and uploading the accompanying data to HDFS; and mining the accompanying data by using a Spark based matrix pruning parallel frequent item set mining algorithm to obtain an accompanying vehicle set. Compared with the prior art, the large-scale vehicle-passing data oriented accompanying vehicle identification method improves the identification efficiency of an accompanying vehicle and can reduce the identification cost of the accompanying vehicle.

The invention provides a privacy protection frequent item set mining method for a large-scale shopping mall transaction record, so as to solve the technical problem of a large amount of calculation during a frequent item set mining process under a high privacy protection level existing in the prior art. The method comprises steps: an evaluator acquires a public-private key pair, and any user generates a shared key; each user sends an encrypted transaction record to a cloud service provider, and a miner sends an encrypted mining query, a ciphertext with a goods number existing in the mining query and a support threshold ciphertext to the cloud service provider; and the cloud service provider acquires an encrypted false transaction record; and the cloud service and the evaluator interact tojudge whether the mining query is a frequent item set. The mining frequency is high.

The invention discloses a multidimensional analysis visual representation method of the centralized monitoring mass data of a transformer substation. The multidimensional analysis visual representation method comprises the following steps: S1) obtaining the mass warning data of the transformation substation, carrying out each-dimensionality analysis statistical processing to the mass warning data, carrying out frequent item set mining to an analysis statistical result to obtain a frequent item set, i.e. equipment closely related to a frequency reporting signal; and S2) paying attention to the equipment which satisfies frequent item set conditions, and carrying out visual representation on a signal distribution diagram and a theme window. The invention can help a dispatcher to macroscopically master the general operation situation of a whole power grid, discloses possibly potential problems and weak links, and points out the potential risks of the power grid from multiple angles, such as single types, frequent warning, equipment types, power plant and power station gathering so as to alleviate monitoring pressure and improve the control ability of the dispatcher to the whole power grid.

The invention discloses an on-line classroom discussion short text real-time grouping method and system based on text clustering. The method comprises the steps of conducting word-splitting preprocessing and stop-word preprocessing on text data; obtaining all text item keywords, counting all the text item keywords and storing the text item keywords into a keyword table keyTable; conducting frequent item set mining on a preprocessed text set, filtering all sub-item quasi-frequent item sets and conducting coarse cluster classification in combination with a keyword table definition quasi-frequentitem set similarity calculation rule; mapping points, the closest to the cluster center, of all clusters to the text set, calculating TF-IDF values of text word sets in all the clusters and iteratingthe center of mass to be optimal according to the distance; pushing the obtained K clusters in real time in group. Through the combination of the keyword table definition quasi-frequent item set similarity calculation rule, the clustering accuracy of an on-line discussion short text is effectively improved; through a quasi-frequent item set filtering strategy, the clustering efficiency is effectively improved, and a clustering method is accelerated; the text information content discussed on an on-line classroom is automatically classified into multiple themes, and the text content is groupedaccording to the themes.

The invention discloses a stochastic distributed data stream frequent item set mining system. In the system, a new distributed data stream mining mode for frequent item transactions is adopted, a stochastic frequent item mixer is introduced to improve the accuracy of mining, new transactions, when accumulated to the same number as basic windows, in a data steam are send to n frequent item set mining devices by a data item dividing method according to the different items in the transactions respectively, transaction numbers to which different data items belong are attached to the different data items, and in the frequent item set mining devices, frequent item sets are mined by running and operating different frequent item transactions and the mined frequent item sets are stored in a frequent item set storage. Finally, the data items are fed back to data item dividers through the stochastic frequent item mixer for deep mining. Compared with other methods, the method has the advantages of small memory storage space, high response speed and the like. Meanwhile, the coverage of mode mining can be ensured by increasing the number of the frequent item set mining devices or feedback times.

The present invention provides a data processing method based on frequent item set mining, which comprises the following steps of: acquiring a plurality of items of historical data tables and extracting data tables with value fields; acquiring time sequence data tables and non-time sequence data tables from the data tables with the value fields; carrying out segmentation on the time sequence data tables and carrying out cleaning on the non-time sequence data tables to obtain initial shopping basket data; merging a plurality of data tables in the initial shopping basket data to obtain merged shopping basket data; and respectively carrying out frequent item set mining on the initial shopping basket data and the merged shopping basket data to obtain a frequent item result with a designated support degree. According to the data processing method based on frequent item set mining, historical data is subjected to frequent item set mining to obtain the frequent item set support degree of each historical data table, frequent data in a random dimension can be inquired and the data processing method is convenient for an analyst to acquire the data; and meanwhile, the time sequence data is segmented, which is convenient for the analyst to inquire related data according to a time tag.

The invention discloses a frequent item set mining method based on cloud outsourcing transaction data. The method comprises the following steps: sending an encryption system key; sending a query userkey; sending the signature key of each participant; verifying the identity of the data owner; enabling the legal data owner to upload a transaction transaction; inquiring user identity verification; enabling the legal query user to upload query data; disturbing the transaction ciphertext set; calculating the inner product ciphertext of the transaction affair of the query user and each confused transaction; calculating the actual support degree of the transaction affair of the query user; signing and sending a mining result ciphertext; and inquiring a user verification result source and performing decrypting. A digital signature technology is used for verifying the user identity, the cloud server decryption capability is weakened based on a homomorphic encryption algorithm, the privacy of user outsourcing data and the privacy of a mining result are protected, and the safety and reliability of cloud outsourcing data mining are improved.

The invention discloses a mining method of a frequent item set. The mining method is used for solving the problem in the prior art that a plenty of time is consumed by mining the frequent item set in big data. The mining method of the frequent item set comprises the steps of carrying out data segmentation for total data to obtain each sub-data after a main node receives a frequent item set mining task which is appointed by a client and aims at the total data; distributing each sub-data to at least two slave nodes which are used for performing a first-stage task in parallel, wherein the first-stage task specifically comprises the sub-step of carrying out frequent item set mining for the distributed sub-data by utilizing the frequent item set mining algorithm to obtain a local frequent item set; and by the main node, distributing the frequent item set to each slave node which is used for performing a second-stage task in parallel, wherein the second-stage task comprises the sub-step of obtaining the frequent item set of the total data by each slave node which is used for performing the second-stage task. The invention also discloses a mining device of the frequent item set and a mining system of the frequent item set.

The invention discloses a frequent item set mining method for game prop recommendation and belongs to the technical field of data mining. The frequent item set mining method comprises the following steps: firstly, acquiring occurrence times of each item on MapReduce, performing sequencing and threshold screening to reject unqualified items and obtain F-List, dividing the F-List so as to obtain G-List, according to division of G-List, transmitting data to Mapper, performing Mapper processing, transmitting data to Reducer, and performing MapReduce mining on the Reducer; and for mining, firstly acquiring PPCTree on each Reducer, after PPCTree is obtained, acquiring L-List and G-Subsume of corresponding items on each Reducer, and finally performing recursion according to the N-List and the G-Subsume, thereby obtaining a final frequent item set. By adopting the frequent item set mining method, the data is reasonably divided according to load prediction, and thus load balance can be ensured; and as the recursion mining process is optimized, the dense data mining time can be greatly shortened.

The invention provides a method and device for automatically extracting relation beteween knowledge graph events in an economic field , a storage medium and a processor. The method comprises the steps: obtaining original data, wherein the original data is data in the field of economy and finance; according to the event knowledge graph infrastructure and the original data, constructing an event knowledge graph, wherein the event knowledge graph comprises theme events; sorting the theme events according to time; grouping the sorted theme events into a plurality of transactions according to a preset time window, wherein at least one transaction comprises the theme events; based on the affairs, mining association rules by adopting a frequent item set mining algorithm; and determining an association relation of the mined association rules by adopting a machine learning algorithm, wherein the association relation is an event relation. According to the method, the association rules are minedthrough a frequent item set mining algorithm, then the association relation of the mined association rules is determined through a machine learning algorithm, and compared with a judgment method in the prior art, the method can achieve rapid judgment of the event relation.

The invention discloses a recent data stream frequent item set mining method based on CPU+MIC (Central Processing Unit+ Many Integrated Core) cooperative computing. The method is implemented through a CPU and an MIC coprocessor. The method is based on the CPU+MIC cooperative computing. The method comprises the following steps: setting an initial population, wherein individuals in the population are a series of frequent item sets to be selected; implementing a searching process based on crossover, variation and selection operations of a genetic algorithm; and traversing multiple generations of processing to obtain final frequent item sets. Compared with the prior art, the recent data stream frequent item set mining method based on the CPU+MIC cooperative computing has the advantages of reasonable design, easiness and convenience in operation, high mining efficiency and the like. According to the method, data streams in a nested window are processed through the genetic algorithm based on the CPU+MIC cooperative computing, so that a frequent mode in the data streams in the nested window can be rapidly and accurately mined. The method can be applied to decision making in industries of water conservation runoff analysis, power load, financial information and the like.

The invention provides a private data supplying method and device, and relates to the field of privacy protection. The private data supplying method comprises the steps that firstly, private data (regarding different network operators, the opened private data of all users) of all the users is resumptively extracted, and private data items of the corresponding private data are generated; frequent item set mining is conducted on the private data items, and a frequent item set is utilized to represent the feature portion of the private data about one network operator; then the frequent item set is utilized to conduct clustering, and the network operators with similar private data are gathered as a cluster; finally, representative reference private data is extracted from the private data corresponding to each network operator cluster, taken as data capable of being directly acquired by the network operators, and sent to the designated network operators to complete uploading of the privatedata. The mode of uploading the private data can avoid the situation to a certain extent that the private data of the users is excessively disclosed.

The present invention discloses a fine-granularity method for generating API substitution rules based on frequent item set mining. The method is characterized by deducing the substitution rules of old and new versions of API in application by using a frequent item set mining algorithm according to the change of the dispatching of the earlier and latest versions of APIs in a class library. When services are extracted from each matched method pair, original codes of the matched method pair are compared by an LCS algorithm, a plurality of matched code segment pairs are generated by taking a point in which the number of same code lines is greater than the Range of the specified threshold as a division point, then the services are generated by change of the dispatching relation of each pair of code segments. Compared against the solution of generating the change of the dispatching relation by taking the method as a unit, the context information of the dispatching method is retained to a certain extent; the accuracy of the services is improved; according to the method, frequency item sets are generated by applying the frequent item set mining algorithm to the generated service sets, then association rules are generated, such that more various API substitution rules can be generated.