Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „The rules of the ranking of creditors“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "The rules of the ranking of creditors" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "The rules of the ranking of creditors"
Kharisma Ika Nurkhasanah, Dhafina Fazarona und Cantika Asnanti. „Legal Protection for Creditors Holding Second Rank Collateral that Cannot Be Executed“. Indonesian Journal of Interdisciplinary Research in Science and Technology 3, Nr. 2 (28.02.2025): 209–24. https://doi.org/10.55927/marcopolo.v3i2.10.
Der volle Inhalt der QuelleAl-Barashdi, Saleh, und Horace Yeung. „An Assessment of Various Theoretical Approaches to Bankruptcy Law“. Journal of Arts and Social Sciences [JASS] 9, Nr. 1 (11.06.2018): 23. http://dx.doi.org/10.24200/jass.vol9iss1pp23-36.
Der volle Inhalt der QuelleAl-Barashdi, Saleh, und Horace Yeung. „An Assessment of Various Theoretical Approaches to Bankruptcy Law“. Journal of Arts and Social Sciences [JASS] 9, Nr. 1 (11.06.2018): 23–36. http://dx.doi.org/10.53542/jass.v9i1.2624.
Der volle Inhalt der QuelleWalther, Ansgar, und Lucy White. „Rules versus Discretion in Bank Resolution“. Review of Financial Studies 33, Nr. 12 (12.03.2020): 5594–629. http://dx.doi.org/10.1093/rfs/hhaa032.
Der volle Inhalt der QuelleKuznetsov, A. A. „Conditions for Creditors to Exercise Special Rights during Reorganization“. Lex Russica 74, Nr. 2 (25.02.2021): 21–28. http://dx.doi.org/10.17803/1729-5920.2021.171.2.021-028.
Der volle Inhalt der QuelleConnell, Brendan J. „Electoral Rules, Interest Group Pressures, and the Price of Democratic Default“. International Studies Quarterly 63, Nr. 4 (26.08.2019): 987–1000. http://dx.doi.org/10.1093/isq/sqz067.
Der volle Inhalt der QuelleCARLOS, ANN M., EDWARD KOSACK und LUIS CASTRO PENARRIETA. „Bankruptcy, Discharge, and the Emergence of Debtor Rights in Eighteenth-Century England“. Enterprise & Society 20, Nr. 2 (16.10.2018): 475–506. http://dx.doi.org/10.1017/eso.2018.69.
Der volle Inhalt der QuelleZhang, Xinyu. „Study on the Application of the Rules of Corporate Personality Denial“. Frontiers in Business, Economics and Management 10, Nr. 2 (14.08.2023): 370–76. http://dx.doi.org/10.54097/fbem.v10i2.11072.
Der volle Inhalt der QuelleMAULUDIN, NOVIE AFIF. „KEDUDUKAN KREDITOR SEPARATIS DALAM PROSES KEPAILITAN“. GANEC SWARA 17, Nr. 1 (04.03.2023): 24. http://dx.doi.org/10.35327/gara.v17i1.366.
Der volle Inhalt der QuelleLiu, Yongkang. „A Research on Substantive Merger Bankruptcy Rules“. Asian Journal of Social Science Studies 7, Nr. 3 (28.03.2022): 49. http://dx.doi.org/10.20849/ajsss.v7i3.1036.
Der volle Inhalt der QuelleDissertationen zum Thema "The rules of the ranking of creditors"
Serre, Pauline. „L'éviction de la loi du concours en procédure collective par les garanties“. Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ0026.
Der volle Inhalt der QuelleIn an era where the will of the French legislator is to prioritize the rescue of the distressed debtor at all costs, what remains for creditors seeking to secure their payment?The evolution of insolvency law has been marked by the prioritization of the debtor's interests to the detriment of those of the creditors. Nowadays, the initiation of an insolvency proceeding significantly reduces their chances of recovering their claims, even when they hold a preferential right.In this context, the necessity for creditors to secure guarantees that can resist insolvency proceedings has become crucial. Thus, they have turned to techniques that allow them to ensure payment outside of the rules of the ranking of creditors established by the legislator. These eviction techniques, mostly arising from practice, have seen considerable growth following the latest reforms of Book VI of the Commercial Code and Book IV of the Civil Code. They are now diverse and can be based on real securities, but also on guarantees, with multiple legal foundations. As a result, there is a lack of uniform treatment in ordinary law, whose heterogeneity is considerably amplified in the field of insolvency law.Indeed, the legislator, far from establishing a unified regime, has implemented specific mechanisms aimed at protecting the debtor. However, these measures will not apply uniformly across all procedures, nor to all techniques that allow creditors to obtain payment outside the rules of the ranking of creditors.This exclusion from the rules of the ranking of creditors constitutes a crucial issue for creditors; therefore it appears essential to determine its conditions, modalities, temporal aspects, and the form it will take when the debtor is subject to an insolvency proceeding
Lamboray, Claude. „Prudent ranking rules: theoretical contributions and applications“. Doctoral thesis, Universite Libre de Bruxelles, 2007. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210662.
Der volle Inhalt der Quelle
Doctorat en Sciences de l'ingénieur
info:eu-repo/semantics/nonPublished
Yun, Bruno. „Argumentation techniques for existential rules“. Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS011/document.
Der volle Inhalt der QuelleIn this thesis, we investigate reasoning techniques with argumentation graphs generated from inconsistent knowledge bases expressed in the existential rules language. The existential rules language is a subset of first-order logic in which a knowledge base is composed of two layers: a fact layer and an ontology layer.The fact layer consists of factual knowledge (usually stored in relational databases) whereas the ontology layer consists of reasoning rules of deduction and negative constraints.Since the classical query answering approaches fail in the presence of inconsistencies, we chose to work with an conflict-tolerant reasoning approach that is based on building graphs with structured arguments and attacks from the deductions of the underlying logical knowledge base.The three main results are the following. First, we study how argumentation graphs are obtained from knowledge bases expressed in existential rules, the structural properties of such graphs and show several insights as to how their generation can be improved. Second, we propose a framework that generates an argumentation graph with a special feature called sets of attacking arguments instead of the regular binary attack relation and show how it improves upon the current state-of-the-art using an empirical analysis. Third, we interest ourselves to ranking-based approaches in both the context of query answering and argumentation reasoning. In the former, we introduce a framework that is based on ranking maximal consistent subsets of facts (repairs) in order to have a more productive query answering. In the latter, we set up the foundation theory for semantics that rank arguments in argumentation graphs with sets of attacking arguments
Khani, Hossein. „Ordinal Power Indices“. Thesis, Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLD025.
Der volle Inhalt der QuelleThe design of procedures aimed at ranking individuals according to how they behave in various groups is of great importance in many practical situations. The problem occurs in a variety of scenarios coming from social choice theory,cooperative game theory or multi-attribute decision theory, and examples include: comparing researchers in a scientificdepartment by taking into account their impact across different teams; finding the most influential political parties in aparliament based on past alliances within alternative majority coalitions; rating attributes according to their influence ina multi-attribute decision context, where independence of attributes is not verified because of mutual interactions. However, in many real world applications, a precise evaluation on the coalitions’ “power” may be hard for many reasons (e.g., uncertain data, complexity of the analysis, missing information or difficulties in the update, etc.). In this case, it may be interesting to consider only ordinal information concerning binary comparisons between coalitions. The main objectiveof this thesis is to study the problem of finding an ordinal ranking over the set N of individuals (called social ranking),given an ordinal ranking over its power set (called power relation). In order to do that, during the thesis we use notionsin classical voting theory and cooperative game theory. Mainly, we have defined solution concepts named ceteris paribusmajority rule, and ordinal Banzhad index, which are respectively inspired from classical voting theory and cooperativegame theory. Since the majority of our work in the thesis is to study solutions from property-driven approach, we axiomatically study the solutions by reformulating axioms in classical voting theory. Finally, exploring weighted extensionsof the ceteris paribus majority rule to rank more than two individuals result in an axiomatic study of families of weightedsolutions
Yeh, Yi-Ren, und 葉倚任. „Ranking Rules and Instances of Decision Trees“. Thesis, 2006. http://ndltd.ncl.edu.tw/handle/996p7y.
Der volle Inhalt der Quelle國立臺灣科技大學
資訊工程系
94
Traditionally, decision trees rank instances by using the local probability estimations for each leaf node. The instances in the same leaf node will be estimated with equal probabilities. In this thesis, we propose a hierarchical ranking strategy by combining decision trees and leaf weighted Na\"{i}ve Bayes to improve the local probability estimation for a leaf node. We consider the importance of the rules, and then rank the instances fit in with the rules. Because the probability estimations based on Na\"{i}ve Bayes might be poor, we investigate some different techniques which were proposed to modify Na\"{i}ve Bayes as well. Experiments show that our proposed method has significantly better performance than that of other methods according to paired $t$-test. All results are evaluated by using AUC (Area under ROC Curve) instead of classification accuracy.
Shih, Chih-Jen, und 石志仁. „Studies on App Ranking Rules by Using ANP and DEMATEL“. Thesis, 2013. http://ndltd.ncl.edu.tw/handle/53056858722871185924.
Der volle Inhalt der Quelle東吳大學
資訊管理學系
102
With the trend toward to high volume of sales of smart phones and increasingly popularity of mobile internet, IT industry in the past centered by desktop computers nowadays develops rapidly toward to hand held devices (Smart Phones). The most influential application is the App Store set up first by Apple Computer Company. Subsequently, Google and Microsoft set up their own software store. In few years, APP market scope will be expected to expand rapidly to $54 billion in 2015 from zero in 2008. Many software companies begin to research and sale APPs. These new competitors rapidly develop variety of applications of smart phones, which results in fierce competition in APP industry. Now is the important moment to change for software industry environment to face; while those APPs rated outside APP store ranking would disappear even though they were once ranking inside it with high popularity. So the APP store ranking will be the judgment of APPs and every software company seeks top ranking by all means. With the characteristics of Delphi, DEMAEL and ANP, this research comprehensively analyzes key factors of APP ranking to provide competition strategies and upgrade advices for APP industry. Besides evaluating the current APP store ranking rules, we also hope that APP companies pay attention to it and further more evaluate and develop more comprehensive ranking rules. With the DEMATEL analysis and aggregation of expert-questionnaire replies, this research by influence characteristic finds out the key factors are 「rating」and「download count」. This study also provides strategy application on mobile internet for industry and academic circles to raise efficiency of enterprise resource use and competitive strength.
Hsieh, Chung-Hao. „Approximate Matching and Ranking of Web Services Using Ontologies and Rules“. 2007. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2607200712340100.
Der volle Inhalt der QuelleHsieh, Chung-Hao, und 謝仲豪. „Approximate Matching and Ranking of Web Services Using Ontologies and Rules“. Thesis, 2007. http://ndltd.ncl.edu.tw/handle/00537472261575835274.
Der volle Inhalt der Quelle臺灣大學
資訊管理學研究所
95
Web Service technology, which is a software framework supporting interoperable machine-to-machine interaction over the Internet, has transformed the Web from a static collection of information into a dynamic service repository. As the number of available Web services continues to grow, service matching becomes an increasingly important issue. Matching is the process that requires a service repository to take a requirement as input, and return all the advertisements that satisfy the requirements specified in the input query. However, since users'' requirements may vary from person to person, it is unrealistic to expect that a matching scheme will always find services that match requirements perfectly. When exact matches cannot be achieved, an approximate matching scheme, which gives satisfying and ranked results, will be needed. In this thesis, we integrate previous approaches that can deal with "quantitative relations" and allow users to specify "matching accuracy settings". We then extend them with an approach to model "concept composition". Concept composition could be useful when we want to compose two concepts linked by a certain property. Since there is no such constructor in Description Logic, we use individuals to represent concepts which are leaf nodes of the ontology. Then, we use a role to represent the composition relationship. In our scheme, domain knowledge is stored in the knowledge base in the form of ontologies and rules. We model service descriptions as concept expressions. Therefore, service matching problems can be transformed into concept subsumption checking, which is a basic reasoning service supported by reasoners. To approximate users'' requirements, we try to relax the constraints of requirements by substituting these constraints with more general ones. Furthermore, we rank these results according to our ranking scheme, which can provide a relative priority for users to select services that best fit their needs. To validate our approach, we implement a prototype system - the Matchmaker, which focuses on the tourism domain. This system is fully integrated with the Traveller, which is a prototype system of the service composition framework that demonstrates the process from service description acquisition, service matching to service execution. With our matching system, users are able to specify their concern toward certain domain specific constraints by matching accuracy settings and acquire substitute services that approximately fit their needs.
Yu, Cheng-Sheng, und 游程盛. „Integration of ranking and scoring for association rules in network reconstruction applied to interdisciplinary complex data“. Thesis, 2019. http://ndltd.ncl.edu.tw/handle/vh3n3t.
Der volle Inhalt der Quelle國立交通大學
統計學研究所
107
There are biomedical issues with big and complicated data that need systematic statistical analyses. We constructed an integration of association rule on networks to explore differing problems such as strokes and healthcare-associated infections (HAIs) in clinical investigations. An ischemic stroke is typically caused by the blockage of a blood vessel. Carotid artery stenting is a treatment for ischemic stroke patients with moderate-to-severe carotid artery stenosis. Our methods provide a visual way to detect the outcome and risk factors of baseline characteristics, and pre-stenting carotid ultrasound data for stroke patients undergoing operations. We also used the comparable network to detect the difference between two groups upon completion of the operations. For the infection topic, the transmission of pathogens via surface contamination is a critical issue in HAIs. Our method drew a dynamic network dependent on time, to monitor the environmental cleaning in the ward, which is necessary to reduce completely the risk of HAIs. The network revealed the drawbacks of a standard operating procedure in cleaning. Our system integrated the association rule in Statistics with ranking and scoring functions built into the network that provided a visual network analysis, which is the optimal way for sophisticated high dimensional data issues.
Chen, Chia-Ling, und 陳佳伶. „New Fuzzy Interpolative Reasoning Methods Based on Ranking Values of Polygonal Fuzzy Sets, Automatically Generated Weights of Fuzzy Rules and Similarity Measures Between Polygonal Fuzzy Sets“. Thesis, 2015. http://ndltd.ncl.edu.tw/handle/47496074659379726144.
Der volle Inhalt der Quelle國立臺灣科技大學
資訊工程系
103
Fuzzy interpolative reasoning is a very important research topic for sparse fuzzy rule-based systems. In this thesis, we propose two new fuzzy interpolative reasoning methods for sparse fuzzy rule-based systems based on polygonal fuzzy sets and the ranking values of polygonal fuzzy sets. In the first method of our thesis, we propose a new fuzzy interpolative reasoning method for sparse fuzzy rule-based systems based on ranking values of polygonal fuzzy sets and automatically generated weights of fuzzy rules. The experimental results show that the proposed method can overcome the drawbacks of the existing fuzzy interpolative reasoning methods for fuzzy interpolative reasoning in sparse fuzzy rule-based systems. In the second method of our thesis, we propose a new adaptive fuzzy interpolation method based on ranking values of polygonal fuzzy sets and similarity measures between polygonal fuzzy sets. The proposed adaptive fuzzy interpolation method performs fuzzy interpolative reasoning using multiple fuzzy rules with multiple antecedent variables and solves the contradictions after the fuzzy interpolative reasoning processes based on similarity measures between polygonal fuzzy sets. The experimental results show that the proposed adaptive fuzzy interpolation method outperforms the existing methods for fuzzy interpolative reasoning in sparse fuzzy rule-based systems.
Bücher zum Thema "The rules of the ranking of creditors"
Office, General Accounting. Tax administration: Electronic filing falling short of expectations : report to the ranking minority member, Committee on Government Affairs, U.S. Senate. Washington, D.C: The Office, 1995.
Den vollen Inhalt der Quelle findenOffice, General Accounting. Tax administration: Assessment of IRS' report on its fiscal year 1995 compliance initiatives : report to the Ranking Minority Member, Committee on Governmental Affairs, U.S. Senate. Washington, D.C: The Office, 1997.
Den vollen Inhalt der Quelle findenOffice, General Accounting. Tax administration: IRS's innocent spouse program performance improved--balanced performance measures needed : report to the Chairman and Ranking Minority Member, Committee on Finance, U.S. Senate. Washington, D.C: U.S. General Accounting Office, 2002.
Den vollen Inhalt der Quelle findenOffice, General Accounting. Tax administration: IRS's efforts to improve compliance with employment tax requirements should be evaluated : report to the Ranking Minority Member, Committee on Small Business & Entrepreneurship, U.S. Senate. Washington, D.C: The Office, 2002.
Den vollen Inhalt der Quelle findenUnited States. Congress. House. Committee on Rules., Hrsg. Report on survey of House committee chairmen and ranking minority members on committee operations, staffing, and procedures. Washington: U.S. G.P.O., 1996.
Den vollen Inhalt der Quelle findenUnited States. Congress. House. Committee on Homeland Security, Hrsg. Federal facility security: Staffing approaches used by selected agencies : report to the Ranking Member, Committee on Homeland Security, House of Representatives. Washington, D.C.]: U.S. Govt. Accountability Office, 2011.
Den vollen Inhalt der Quelle findenOffice, General Accounting. Tax administration: Ways to simplify the estimated tax penalty calculation : report to the Chairmen and Ranking Minority Members, Committee on Finance, U.S. Senate, and Committee on Ways and Means, House of Representatives. Washington, D.C. (P.O. Box 37050, Washington, D.C. 20013): The Office, 1998.
Den vollen Inhalt der Quelle findenOffice, General Accounting. Tax administration: Potential impact of alternative taxes on taxpayers and administrators : report to the Chairmen and ranking minority Members, Committee on Finance, U.S. Senate and Committee on Ways and Means, House of Representatives. Washington, D.C. (P.O. Box 37050, Washington, D.C. 20013): The Office, 1998.
Den vollen Inhalt der Quelle findenOffice, General Accounting. Blood supply: Transfusion-associated risks : report to the Ranking Minority Member, Committee on Commerce, House of Representatives. Washington, D.C: The Office, 1997.
Den vollen Inhalt der Quelle findenUnited States. Congress. House. Committee on Commerce., Hrsg. Blood supply: Transfusion-associated risks : report to the Ranking Minority Member, Committee on Commerce, House of Representatives. Washington, D.C: The Office, 1997.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "The rules of the ranking of creditors"
Donaldson, T. H. „Ranking of Creditors: The Principles and the Instruments“. In More Thinking about Credit, 1–24. London: Palgrave Macmillan UK, 1995. http://dx.doi.org/10.1007/978-1-349-13763-3_1.
Der volle Inhalt der QuelleZhang, Jianping, Jerzy W. Bala, Ali Hadjarian und Brent Han. „Ranking Cases with Classification Rules“. In Preference Learning, 155–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14125-6_8.
Der volle Inhalt der Quellede Sá, Cláudio Rebelo, Carlos Soares, Alípio Mário Jorge, Paulo Azevedo und Joaquim Costa. „Mining Association Rules for Label Ranking“. In Advances in Knowledge Discovery and Data Mining, 432–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20847-8_36.
Der volle Inhalt der QuelleStańczyk, Urszula. „Attribute Ranking Driven Filtering of Decision Rules“. In Rough Sets and Intelligent Systems Paradigms, 217–24. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08729-0_21.
Der volle Inhalt der Quellede Carvalho, Veronica Oliveira, Davi Duarte de Paula, Mateus Violante Pacheco, Waldeilson Eder dos Santos, Renan de Padua und Solange Oliveira Rezende. „Ranking Association Rules by Clustering Through Interestingness“. In Advances in Soft Computing, 336–51. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02837-4_28.
Der volle Inhalt der QuelleBotvinko, Anatoly, und Konstantin Samouylov. „Firewall Simulation Model with Filtering Rules Ranking“. In Communications in Computer and Information Science, 533–45. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-66242-4_42.
Der volle Inhalt der QuelleLu, Zhongkang, Zheru Chi, Pengfei Shi und Eam Khwang Teoh. „Ranking Segmentation Paths Using Fuzzified Decision Rules“. In Fuzzy Techniques in Image Processing, 287–307. Heidelberg: Physica-Verlag HD, 2000. http://dx.doi.org/10.1007/978-3-7908-1847-5_11.
Der volle Inhalt der QuelleSomol, Petr, Jiří Grim, Jiří Filip und Pavel Pudil. „On Stopping Rules in Dependency-Aware Feature Ranking“. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 286–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41822-8_36.
Der volle Inhalt der QuelleLiu, Bing, Yiming Ma und Ching Kian Wong. „Scoring and Ranking the Data Using Association Rules“. In Data Mining, Rough Sets and Granular Computing, 190–215. Heidelberg: Physica-Verlag HD, 2002. http://dx.doi.org/10.1007/978-3-7908-1791-1_9.
Der volle Inhalt der QuelleSabu, M. K., und G. Raju. „A Rough Set Based Approach for Ranking Decision Rules“. In Advances in Computing and Communications, 671–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22709-7_65.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "The rules of the ranking of creditors"
Jiye Li und N. Cercone. „Discovering and ranking important rules“. In 2005 IEEE International Conference on Granular Computing. IEEE, 2005. http://dx.doi.org/10.1109/grc.2005.1547343.
Der volle Inhalt der QuelleKozar, Vladimir. „OSTVARIVANjE ZALOŽNIH PRAVA U STEČAJNOM POSTUPKU IZ VREDNOSTI OPTEREĆENE IMOVINE“. In XVII majsko savetovanje. Pravni fakultet Univerziteta u Kragujevcu, 2021. http://dx.doi.org/10.46793/uvp21.929k.
Der volle Inhalt der QuelleRico, Noelia, Raul Perez-Fernandez und Irene Diaz. „Incorporating ranking rules into k nearest neighbours“. In 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2019. http://dx.doi.org/10.1109/fuzz-ieee.2019.8858892.
Der volle Inhalt der QuelleDall’Agnol, Maicon, und Veronica Oliveira De Carvalho. „Ranking Rules in Associative Classifiers via Borda’s Methods“. In 2023 18th Iberian Conference on Information Systems and Technologies (CISTI). IEEE, 2023. http://dx.doi.org/10.23919/cisti58278.2023.10212078.
Der volle Inhalt der QuelleBartulović, Željko, und Dejan Bodul. „POLOŽAJ RAZLUČNIH VJEROVNIKA U POSTUPKU STEČAJA POTROŠAČA“. In 14 Majsko savetovanje. University of Kragujevac, Faculty of Law, 2018. http://dx.doi.org/10.46793/xivmajsko.835b.
Der volle Inhalt der QuelleBouker, S., R. Saidi, S. B. Yahia und E. M. Nguifo. „Ranking and Selecting Association Rules Based on Dominance Relationship“. In 2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012). IEEE, 2012. http://dx.doi.org/10.1109/ictai.2012.94.
Der volle Inhalt der QuelleYang, Guangfei, Shingo Mabu Mabu, Kaoru Shimada, Yunlu Gong und Kotaro Hirasawa. „Ranking association rules for classification based on genetic network programming“. In the 11th Annual conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1569901.1570234.
Der volle Inhalt der QuelleKazienko, P., und P. Kuzminska. „The influence of indirect association rules on recommendation ranking lists“. In 5th International Conference on Intelligent Systems Design and Applications (ISDA'05). IEEE, 2005. http://dx.doi.org/10.1109/isda.2005.90.
Der volle Inhalt der QuelleMandal, Manishankar, Chanchal K. Roy und Kevin A. Schneider. „Automatic ranking of clones for refactoring through mining association rules“. In 2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering and Reverse Engineering (CSMR-WCRE). IEEE, 2014. http://dx.doi.org/10.1109/csmr-wcre.2014.6747161.
Der volle Inhalt der QuelleDatta, Subrata, Kalyani Mali und Pratyay Roy. „Ranking of association rules toward smart decision for smart city“. In 2017 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET). IEEE, 2017. http://dx.doi.org/10.1109/wispnet.2017.8299993.
Der volle Inhalt der Quelle