Association rules mining is a major data mining field that leads to discovery of associations and correlations among items in today’s big data environment. The conventional association rule mining focuses mainly on p...Association rules mining is a major data mining field that leads to discovery of associations and correlations among items in today’s big data environment. The conventional association rule mining focuses mainly on positive itemsets generated from frequently occurring itemsets (PFIS). However, there has been a significant study focused on infrequent itemsets with utilization of negative association rules to mine interesting frequent itemsets (NFIS) from transactions. In this work, we propose an efficient backward calculating negative frequent itemset algorithm namely EBC-NFIS for computing backward supports that can extract both positive and negative frequent itemsets synchronously from dataset. EBC-NFIS algorithm is based on popular e-NFIS algorithm that computes supports of negative itemsets from the supports of positive itemsets. The proposed algorithm makes use of previously computed supports from memory to minimize the computation time. In addition, association rules, i.e. positive and negative association rules (PNARs) are generated from discovered frequent itemsets using EBC-NFIS algorithm. The efficiency of the proposed algorithm is verified by several experiments and comparing results with e-NFIS algorithm. The experimental results confirm that the proposed algorithm successfully discovers NFIS and PNARs and runs significantly faster than conventional e-NFIS algorithm.展开更多
Periodic patternmining has become a popular research subject in recent years;this approach involves the discoveryof frequently recurring patterns in a transaction sequence. However, previous algorithms for periodic pa...Periodic patternmining has become a popular research subject in recent years;this approach involves the discoveryof frequently recurring patterns in a transaction sequence. However, previous algorithms for periodic patternmining have ignored the utility (profit, value) of patterns. Additionally, these algorithms only identify periodicpatterns in a single sequence. However, identifying patterns of high utility that are common to a set of sequencesis more valuable. In several fields, identifying high-utility periodic frequent patterns in multiple sequences isimportant. In this study, an efficient algorithm called MHUPFPS was proposed to identify such patterns. To addressexisting problems, three new measures are defined: the utility, high support, and high-utility period sequenceratios. Further, a new upper bound, upSeqRa, and two new pruning properties were proposed. MHUPFPS usesa newly defined HUPFPS-list structure to significantly accelerate the reduction of the search space and improvethe overall performance of the algorithm. Furthermore, the proposed algorithmis evaluated using several datasets.The experimental results indicate that the algorithm is accurate and effective in filtering several non-high-utilityperiodic frequent patterns.展开更多
In the network security system,intrusion detection plays a significant role.The network security system detects the malicious actions in the network and also conforms the availability,integrity and confidentiality of da...In the network security system,intrusion detection plays a significant role.The network security system detects the malicious actions in the network and also conforms the availability,integrity and confidentiality of data informa-tion resources.Intrusion identification system can easily detect the false positive alerts.If large number of false positive alerts are created then it makes intrusion detection system as difficult to differentiate the false positive alerts from genuine attacks.Many research works have been done.The issues in the existing algo-rithms are more memory space and need more time to execute the transactions of records.This paper proposes a novel framework of network security Intrusion Detection System(IDS)using Modified Frequent Pattern(MFP-Tree)via K-means algorithm.The accuracy rate of Modified Frequent Pattern Tree(MFPT)-K means method infinding the various attacks are Normal 94.89%,for DoS based attack 98.34%,for User to Root(U2R)attacks got 96.73%,Remote to Local(R2L)got 95.89%and Probe attack got 92.67%and is optimal when it is compared with other existing algorithms of K-Means and APRIORI.展开更多
Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting corre...Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting correlations, frequent patterns, associations, or causal structures between items hidden in a large database. By exploiting quantum computing, we propose an efficient quantum search algorithm design to discover the maximum frequent patterns. We modified Grover’s search algorithm so that a subspace of arbitrary symmetric states is used instead of the whole search space. We presented a novel quantum oracle design that employs a quantum counter to count the maximum frequent items and a quantum comparator to check with a minimum support threshold. The proposed derived algorithm increases the rate of the correct solutions since the search is only in a subspace. Furthermore, our algorithm significantly scales and optimizes the required number of qubits in design, which directly reflected positively on the performance. Our proposed design can accommodate more transactions and items and still have a good performance with a small number of qubits.展开更多
We reported a biopsy proved case of minimal change nephrotic syndrome in a 72-year-old patient. The minimal change nephrotic syndrome has been steroid sensitive, but the patient had 7 relapses over a span of 5 years. ...We reported a biopsy proved case of minimal change nephrotic syndrome in a 72-year-old patient. The minimal change nephrotic syndrome has been steroid sensitive, but the patient had 7 relapses over a span of 5 years. Each time the dose of steroid is tapered, a relapse of the nephrotic syndrome occurred. Eventually, the patient was complaining of dysphagia and difficulty swallowing. Hospital work-up with barium swallow, endoscopy, and CT of the chest, abdomen and pelvis, revealed a focal stenotic lesion with mild to moderate esophageal dysmotility 7/15/2022. A diagnosis of an ulcerating lesion with biopsy confirmed a neuro-endocrine carcinoma of the gastro-esophageal junction was entertained. The CT of the chest/abdomen/pelvis, 7/19/2022, has shown, an esophageal mass of 5.1 × 5.6 × 7 cm of the gastro-esophageal junction with ulceration. No evidence of spread beyond the esophagus and stomach. The histology revealed a poorly differentiated neuroendocrine tumor of the gastro-esophageal junction. The patient underwent several rounds of chemotherapy, radiation, and surgery culminating in tumor control. His nephrotic syndrome was resolved after the tumor has been controlled by surgery and chemotherapy.展开更多
Left atrial appendage aneurysm(LAAA)was first reported in the 1960s.1 LAAA is a rare condition,with just over 100 congenital or acquired cases reported to date.2 LAAA is frequently diagnosed incidentally during echoca...Left atrial appendage aneurysm(LAAA)was first reported in the 1960s.1 LAAA is a rare condition,with just over 100 congenital or acquired cases reported to date.2 LAAA is frequently diagnosed incidentally during echocardiography or computed tomography(CT)scans.Most patients with LAAA are asymptomatic,while a few exhibit nonspecific symptoms,such as dyspnea,palpitation,and chest tightness.Patients with LAAA frequently present with atrial arrhythmias and systemic thromboembolism,such as stroke or multiorgan infarctions,due to the formation of a left atrial appendage thrombus.3 The lesion may be cured using aneurysm resection.Considering it as the potential cause of atrial arrhythmias and thromboembolism,the lesion must be identified on time and cured using a suitable treatment approach.展开更多
文摘Association rules mining is a major data mining field that leads to discovery of associations and correlations among items in today’s big data environment. The conventional association rule mining focuses mainly on positive itemsets generated from frequently occurring itemsets (PFIS). However, there has been a significant study focused on infrequent itemsets with utilization of negative association rules to mine interesting frequent itemsets (NFIS) from transactions. In this work, we propose an efficient backward calculating negative frequent itemset algorithm namely EBC-NFIS for computing backward supports that can extract both positive and negative frequent itemsets synchronously from dataset. EBC-NFIS algorithm is based on popular e-NFIS algorithm that computes supports of negative itemsets from the supports of positive itemsets. The proposed algorithm makes use of previously computed supports from memory to minimize the computation time. In addition, association rules, i.e. positive and negative association rules (PNARs) are generated from discovered frequent itemsets using EBC-NFIS algorithm. The efficiency of the proposed algorithm is verified by several experiments and comparing results with e-NFIS algorithm. The experimental results confirm that the proposed algorithm successfully discovers NFIS and PNARs and runs significantly faster than conventional e-NFIS algorithm.
文摘Periodic patternmining has become a popular research subject in recent years;this approach involves the discoveryof frequently recurring patterns in a transaction sequence. However, previous algorithms for periodic patternmining have ignored the utility (profit, value) of patterns. Additionally, these algorithms only identify periodicpatterns in a single sequence. However, identifying patterns of high utility that are common to a set of sequencesis more valuable. In several fields, identifying high-utility periodic frequent patterns in multiple sequences isimportant. In this study, an efficient algorithm called MHUPFPS was proposed to identify such patterns. To addressexisting problems, three new measures are defined: the utility, high support, and high-utility period sequenceratios. Further, a new upper bound, upSeqRa, and two new pruning properties were proposed. MHUPFPS usesa newly defined HUPFPS-list structure to significantly accelerate the reduction of the search space and improvethe overall performance of the algorithm. Furthermore, the proposed algorithmis evaluated using several datasets.The experimental results indicate that the algorithm is accurate and effective in filtering several non-high-utilityperiodic frequent patterns.
文摘In the network security system,intrusion detection plays a significant role.The network security system detects the malicious actions in the network and also conforms the availability,integrity and confidentiality of data informa-tion resources.Intrusion identification system can easily detect the false positive alerts.If large number of false positive alerts are created then it makes intrusion detection system as difficult to differentiate the false positive alerts from genuine attacks.Many research works have been done.The issues in the existing algo-rithms are more memory space and need more time to execute the transactions of records.This paper proposes a novel framework of network security Intrusion Detection System(IDS)using Modified Frequent Pattern(MFP-Tree)via K-means algorithm.The accuracy rate of Modified Frequent Pattern Tree(MFPT)-K means method infinding the various attacks are Normal 94.89%,for DoS based attack 98.34%,for User to Root(U2R)attacks got 96.73%,Remote to Local(R2L)got 95.89%and Probe attack got 92.67%and is optimal when it is compared with other existing algorithms of K-Means and APRIORI.
文摘Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting correlations, frequent patterns, associations, or causal structures between items hidden in a large database. By exploiting quantum computing, we propose an efficient quantum search algorithm design to discover the maximum frequent patterns. We modified Grover’s search algorithm so that a subspace of arbitrary symmetric states is used instead of the whole search space. We presented a novel quantum oracle design that employs a quantum counter to count the maximum frequent items and a quantum comparator to check with a minimum support threshold. The proposed derived algorithm increases the rate of the correct solutions since the search is only in a subspace. Furthermore, our algorithm significantly scales and optimizes the required number of qubits in design, which directly reflected positively on the performance. Our proposed design can accommodate more transactions and items and still have a good performance with a small number of qubits.
文摘We reported a biopsy proved case of minimal change nephrotic syndrome in a 72-year-old patient. The minimal change nephrotic syndrome has been steroid sensitive, but the patient had 7 relapses over a span of 5 years. Each time the dose of steroid is tapered, a relapse of the nephrotic syndrome occurred. Eventually, the patient was complaining of dysphagia and difficulty swallowing. Hospital work-up with barium swallow, endoscopy, and CT of the chest, abdomen and pelvis, revealed a focal stenotic lesion with mild to moderate esophageal dysmotility 7/15/2022. A diagnosis of an ulcerating lesion with biopsy confirmed a neuro-endocrine carcinoma of the gastro-esophageal junction was entertained. The CT of the chest/abdomen/pelvis, 7/19/2022, has shown, an esophageal mass of 5.1 × 5.6 × 7 cm of the gastro-esophageal junction with ulceration. No evidence of spread beyond the esophagus and stomach. The histology revealed a poorly differentiated neuroendocrine tumor of the gastro-esophageal junction. The patient underwent several rounds of chemotherapy, radiation, and surgery culminating in tumor control. His nephrotic syndrome was resolved after the tumor has been controlled by surgery and chemotherapy.
基金The case study was approved by the Ethic Committee of Sir Run Run Shaw Hospital,Zhejiang University School of Medicine(20230767).
文摘Left atrial appendage aneurysm(LAAA)was first reported in the 1960s.1 LAAA is a rare condition,with just over 100 congenital or acquired cases reported to date.2 LAAA is frequently diagnosed incidentally during echocardiography or computed tomography(CT)scans.Most patients with LAAA are asymptomatic,while a few exhibit nonspecific symptoms,such as dyspnea,palpitation,and chest tightness.Patients with LAAA frequently present with atrial arrhythmias and systemic thromboembolism,such as stroke or multiorgan infarctions,due to the formation of a left atrial appendage thrombus.3 The lesion may be cured using aneurysm resection.Considering it as the potential cause of atrial arrhythmias and thromboembolism,the lesion must be identified on time and cured using a suitable treatment approach.
