Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userBuilding a Knowledge Discovery in Database (KDD) Model Based on SCRUM Agile Methodology (SCRUM-BI)
بناء نموذج لاكتشاف المعرفة في البيانات يعتمد المنهجيّة الرشيقة سكروم
1559
0 177
0
(
0
)
Publication date
2016
and research's language is
العربية
Created by
Shamra Editor
Ask ChatGPT about the research
نقدم في هذا العمل نموذج جديد لاكتشاف المعرفة في البيانات " SCRUM-BI " يعتمد المنهجية الرّشيقة سكروم، للمساعدة في بناء تطبيقات ذكاء الأعمال ( BI ) و التنقيب في البيانات. يتميز هذا النموذج بأنّه أكثر تكيّفاً مع التغييرات في المتطلبات و الأولويات من جهة، و التطورات المتسارعة في بيئات العمل من جهة أخرى، كما يحسّن و يعزز عملية الحصول على المعرفة و مشاركتها، مما يسهم في دعم عملية اتخاذ القرارات الاستراتيجية. جرى اختبار و تقييم النموذج باستخدام حالة دراسيّة على قطاع شركات الاتصالات في سوريا.
In this work, we are proposing a new model for knowledge discovery in database (KDD) named "SCRUM-BI". It based on SCRUM agile methodology to enhance the way of building Business Intelligence and Data Mining applications. This model characterized as more adaptive to the changing requirements, priorities and rapidly evolving business environments. SCRUM-BI Also improves and enhances the process of knowledge obtaining and sharing, which contributes to support strategic decision-making. The model was validated using a case study on the telecommunications sector in Syria.
References used
G. P. Shapiro, C. Matheus and W. Frawley, "Knowledge Discovery in Databases - An Overview," AI Magazine, pp. 57-70, Septemper 1992
U. Fayyad, G. P. Shapiro and P. Smyth, Advances in knowledge discovery and data mining, Menlo Park, CA: American Association for Artificial Intelligence, 1996
G. P. Shapiro, "Analytics and data mining: The key to successful CRM," in Knowledge Discovery and Data Mining Conference, Boston, MA, 2000
rate research
Read More
Knowledge graph embedding, representing entities and relations in the knowledge graphs with high-dimensional vectors, has made significant progress in link prediction. More researchers have explored the representational capabilities of models in rece
nt years. That is, they investigate better representational models to fit symmetry/antisymmetry and combination relationships. The current embedding models are more inclined to utilize the identical vector for the same entity in various triples to measure the matching performance. The observation that measuring the rationality of specific triples means comparing the matching degree of the specific attributes associated with the relations is well-known. Inspired by this fact, this paper designs Semantic Filter Based on Relations(SFBR) to extract the required attributes of the entities. Then the rationality of triples is compared under these extracted attributes through the traditional embedding models. The semantic filter module can be added to most geometric and tensor decomposition models with minimal additional memory. experiments on the benchmark datasets show that the semantic filter based on relations can suppress the impact of other attribute dimensions and improve link prediction performance. The tensor decomposition models with SFBR have achieved state-of-the-art.
We present on-going work of evaluating the, to our knowledge, first large generative language model trained to converse in Swedish, using data from the online discussion forum Flashback. We conduct a human evaluation pilot study that indicates the mo
del is often able to respond to conversations in both a human-like and informative manner, on a diverse set of topics. While data from online forums can be useful to build conversational systems, we reflect on the negative consequences that incautious application might have, and the need for taking active measures to safeguard against them.
Multi-hop relation detection in Knowledge Base Question Answering (KBQA) aims at retrieving the relation path starting from the topic entity to the answer node based on a given question, where the relation path may comprise multiple relations. Most o
f the existing methods treat it as a single-label learning problem while ignoring the fact that for some complex questions, there exist multiple correct relation paths in knowledge bases. Therefore, in this paper, multi-hop relation detection is considered as a multi-label learning problem. However, performing multi-label multi-hop relation detection is challenging since the numbers of both the labels and the hops are unknown. To tackle this challenge, multi-label multi-hop relation detection is formulated as a sequence generation task. A relation-aware sequence relation generation model is proposed to solve the problem in an end-to-end manner. Experimental results show the effectiveness of the proposed method for relation detection and KBQA.
Inspired by mutual information (MI) based feature selection in SVMs and logistic regression, in this paper, we propose MI-based layer-wise pruning: for each layer of a multi-layer neural network, neurons with higher values of MI with respect to prese
rved neurons in the upper layer are preserved. Starting from the top softmax layer, layer-wise pruning proceeds in a top-down fashion until reaching the bottom word embedding layer. The proposed pruning strategy offers merits over weight-based pruning techniques: (1) it avoids irregular memory access since representations and matrices can be squeezed into their smaller but dense counterparts, leading to greater speedup; (2) in a manner of top-down pruning, the proposed method operates from a more global perspective based on training signals in the top layer, and prunes each layer by propagating the effect of global signals through layers, leading to better performances at the same sparsity level. Extensive experiments show that at the same sparsity level, the proposed strategy offers both greater speedup and higher performances than weight-based pruning methods (e.g., magnitude pruning, movement pruning).
This paper presents the preliminary results of an ongoing project that analyzes the growing body of scientific research published around the COVID-19 pandemic. In this research, a general-purpose semantic model is used to double annotate a batch of 5
00 sentences that were manually selected from the CORD-19 corpus. Afterwards, a baseline text-mining pipeline is designed and evaluated via a large batch of 100,959 sentences. We present a qualitative analysis of the most interesting facts automatically extracted and highlight possible future lines of development. The preliminary results show that general-purpose semantic models are a useful tool for discovering fine-grained knowledge in large corpora of scientific documents.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
