FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2101737005> ?p ?o ?g. }

• W2101737005 endingPage "198" @default.
• W2101737005 startingPage "184" @default.
• W2101737005 abstract "A general form of minimizing the Rayleigh ratio on discrete variables is shown here, for the first time, to be polynomial time solvable. This is significant because major problems in clustering, partitioning, and imaging can be presented as the Rayleigh ratio minimization on discrete variables and an orthogonality constraint. These challenging problems are modeled as the normalized cut problem, the graph expander ratio problem, the Cheeger constant problem, or the conductance problem, all of which are NP-hard. These problems have traditionally been solved, heuristically, using the “spectral technique.” A unified framework is provided here whereby all these problems are formulated as a constrained minimization form of a quadratic ratio, referred to here as the Rayleigh ratio. The quadratic ratio is to be minimized on discrete variables and a single sum constraint that we call the balance or orthogonality constraint. When the discreteness constraints on the variables are disregarded, the resulting continuous relaxation is solved by the spectral method. It is shown here that the Rayleigh ratio minimization subject to the discreteness constraints requiring each variable to assume one of two values in {−b,1} is solvable in strongly polynomial time, equivalent to a single minimum s,t cut algorithm on a graph of same size as the input graph, for any nonnegative value of b. This discrete form for the Rayleigh ratio problem was often assumed to be NP-hard. Not only is it shown here that the discrete Rayleigh ratio problem is polynomial time solvable, but also the algorithm is more efficient than the spectral algorithm. Furthermore, an experimental study demonstrates that the new algorithm provides in practice an improvement, often dramatic, on the quality of the results of the spectral method, both in terms of approximating the true optimum of the Rayleigh ratio problem on both the discrete variables and the balance constraint, and in terms of the subjective partition quality. A further contribution here is the introduction of a problem, the quantity-normalized cut, generalizing all the Rayleigh ratio problems. The discrete version of that problem is also solved with the efficient algorithm presented. This problem is shown, in a companion paper, to enable the modeling of features essential to clustering that are valuable in practical applications." @default.
• W2101737005 created "2016-06-24" @default.
• W2101737005 creator A5085640376 @default.
• W2101737005 date "2013-02-01" @default.
• W2101737005 modified "2023-10-18" @default.
• W2101737005 title "A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant" @default.
• W2101737005 cites W1587744656 @default.
• W2101737005 cites W1978460556 @default.
• W2101737005 cites W1979371339 @default.
• W2101737005 cites W2006132599 @default.
• W2101737005 cites W2013469283 @default.
• W2101737005 cites W2018047324 @default.
• W2101737005 cites W2033281046 @default.
• W2101737005 cites W2033334321 @default.
• W2101737005 cites W2044348081 @default.
• W2101737005 cites W2058871925 @default.
• W2101737005 cites W2062922240 @default.
• W2101737005 cites W2072211488 @default.
• W2101737005 cites W2076977679 @default.
• W2101737005 cites W2090359754 @default.
• W2101737005 cites W2121947440 @default.
• W2101737005 cites W2122792499 @default.
• W2101737005 cites W2134737843 @default.
• W2101737005 cites W2135393523 @default.
• W2101737005 cites W2135674549 @default.
• W2101737005 cites W2147965279 @default.
• W2101737005 cites W2150148016 @default.
• W2101737005 cites W2155074104 @default.
• W2101737005 cites W2160556205 @default.
• W2101737005 cites W2163290928 @default.
• W2101737005 cites W2293231900 @default.
• W2101737005 cites W28099766 @default.
• W2101737005 doi "https://doi.org/10.1287/opre.1120.1126" @default.
• W2101737005 hasPublicationYear "2013" @default.
• W2101737005 type Work @default.
• W2101737005 sameAs 2101737005 @default.
• W2101737005 citedByCount "26" @default.
• W2101737005 countsByYear W21017370052013 @default.
• W2101737005 countsByYear W21017370052014 @default.
• W2101737005 countsByYear W21017370052015 @default.
• W2101737005 countsByYear W21017370052016 @default.
• W2101737005 countsByYear W21017370052017 @default.
• W2101737005 countsByYear W21017370052018 @default.
• W2101737005 countsByYear W21017370052019 @default.
• W2101737005 countsByYear W21017370052020 @default.
• W2101737005 countsByYear W21017370052021 @default.
• W2101737005 countsByYear W21017370052022 @default.
• W2101737005 countsByYear W21017370052023 @default.
• W2101737005 crossrefType "journal-article" @default.
• W2101737005 hasAuthorship W2101737005A5085640376 @default.
• W2101737005 hasConcept C114614502 @default.
• W2101737005 hasConcept C120665830 @default.
• W2101737005 hasConcept C121332964 @default.
• W2101737005 hasConcept C126255220 @default.
• W2101737005 hasConcept C129844170 @default.
• W2101737005 hasConcept C148764684 @default.
• W2101737005 hasConcept C17137986 @default.
• W2101737005 hasConcept C199360897 @default.
• W2101737005 hasConcept C2524010 @default.
• W2101737005 hasConcept C2777027219 @default.
• W2101737005 hasConcept C28826006 @default.
• W2101737005 hasConcept C311688 @default.
• W2101737005 hasConcept C33923547 @default.
• W2101737005 hasConcept C41008148 @default.
• W2101737005 hasConcept C46244369 @default.
• W2101737005 hasConceptScore W2101737005C114614502 @default.
• W2101737005 hasConceptScore W2101737005C120665830 @default.
• W2101737005 hasConceptScore W2101737005C121332964 @default.
• W2101737005 hasConceptScore W2101737005C126255220 @default.
• W2101737005 hasConceptScore W2101737005C129844170 @default.
• W2101737005 hasConceptScore W2101737005C148764684 @default.
• W2101737005 hasConceptScore W2101737005C17137986 @default.
• W2101737005 hasConceptScore W2101737005C199360897 @default.
• W2101737005 hasConceptScore W2101737005C2524010 @default.
• W2101737005 hasConceptScore W2101737005C2777027219 @default.
• W2101737005 hasConceptScore W2101737005C28826006 @default.
• W2101737005 hasConceptScore W2101737005C311688 @default.
• W2101737005 hasConceptScore W2101737005C33923547 @default.
• W2101737005 hasConceptScore W2101737005C41008148 @default.
• W2101737005 hasConceptScore W2101737005C46244369 @default.
• W2101737005 hasIssue "1" @default.
• W2101737005 hasLocation W21017370051 @default.
• W2101737005 hasOpenAccess W2101737005 @default.
• W2101737005 hasPrimaryLocation W21017370051 @default.
• W2101737005 hasRelatedWork W1649663665 @default.
• W2101737005 hasRelatedWork W1967408277 @default.
• W2101737005 hasRelatedWork W1993913882 @default.
• W2101737005 hasRelatedWork W22428745 @default.
• W2101737005 hasRelatedWork W2569940161 @default.
• W2101737005 hasRelatedWork W3025482998 @default.
• W2101737005 hasRelatedWork W3126626577 @default.
• W2101737005 hasRelatedWork W3184887344 @default.
• W2101737005 hasRelatedWork W4287424652 @default.
• W2101737005 hasRelatedWork W3115255814 @default.
• W2101737005 hasVolume "61" @default.
• W2101737005 isParatext "false" @default.
• W2101737005 isRetracted "false" @default.
• W2101737005 magId "2101737005" @default.

• next